import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    }
} import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    }
} Main public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    } main {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    } final Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] L = new int[N]; L new int[N] N int max; max int tmp = 0; tmp 0 for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            L[i] = Integer.parseInt(sc.next());
        } {
            L[i] = Integer.parseInt(sc.next());
        } L[i] = Integer.parseInt(sc.next()) L[i] L i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc Arrays.sort(L) Arrays.sort Arrays L max = L[L.length - 1] max L[L.length - 1] L L.length - 1 L.length L L.length 1 for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        } int i = 0; int i = 0; i 0 i < N-1 i N-1 N 1 i++ i++ i {
           tmp += L[i];
        } {
           tmp += L[i];
        } tmp += L[i] tmp L[i] L i if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        } max < tmp max tmp {
            System.out.print("Yes");
        } System.out.print("Yes") System.out.print System.out System System.out "Yes" {
            System.out.print("No");
        } System.out.print("No") System.out.print System.out System System.out "No" String[] args args public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    }
} public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    }
} Main
import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        final Scanner sc = new Scanner(System.in);

        int N = Integer.parseInt(sc.next());
        int[] L = new int[N];
        int max;
        int tmp = 0;

        for (int i = 0; i < N; i++) {
            L[i] = Integer.parseInt(sc.next());
        }
        Arrays.sort(L);

        max = L[L.length - 1];
        for (int i = 0; i < N-1; i++) {
           tmp += L[i];
        }

        if (max < tmp) {
            System.out.print("Yes");
        } else {
            System.out.print("No");
        }
    }
}