import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    }

    private static String totalMoves(int x[]) {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    }

}

 import java.util.Scanner; Scanner java.util public class Main {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    }

    private static String totalMoves(int x[]) {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    }

} Main public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    } main {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    } Scanner sc=new Scanner(System.in); sc new Scanner(System.in) int N=sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] numbers=new int[N]; numbers new int[N] N for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        } int i=0; int i=0; i 0 i<N i N i++ i++ i {
            numbers[i]=sc.nextInt();
        } {
            numbers[i]=sc.nextInt();
        } numbers[i]=sc.nextInt() numbers[i] numbers i sc.nextInt() sc.nextInt sc sc.close() sc.close sc System.out.println(totalMoves(numbers)) System.out.println System.out System System.out totalMoves(numbers) totalMoves numbers String[] args args private static String totalMoves(int x[]) {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    } totalMoves {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    } int biggest = 0; biggest 0 int sum = 0; sum 0 for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        } int i = 0; int i = 0; i 0 i < x.length i x.length x x.length i++ i++ i {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        } {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        } if(x[i] > biggest) {
                biggest = x[i];
            } x[i] > biggest x[i] x i biggest {
                biggest = x[i];
            } biggest = x[i] biggest x[i] x i sum = sum + x[i] sum sum + x[i] sum x[i] x i sum = sum - biggest sum sum - biggest sum biggest if(sum > biggest) {
            return "Yes";
        } sum > biggest sum biggest {
            return "Yes";
        } return "Yes"; "Yes" return "No"; "No" int x[] x public class Main {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    }

    private static String totalMoves(int x[]) {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    }

} public class Main {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    }

    private static String totalMoves(int x[]) {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    }

} Main
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int N=sc.nextInt();
        int[] numbers=new int[N];
        for(int i=0; i<N; i++) {
            numbers[i]=sc.nextInt();
        }
        sc.close();
        System.out.println(totalMoves(numbers));
    }

    private static String totalMoves(int x[]) {
        int biggest = 0;
        int sum = 0;
        for(int i = 0; i < x.length; i++) {
            if(x[i] > biggest) {
                biggest = x[i];
            }
            sum = sum + x[i];
        }

        sum = sum - biggest;
        if(sum > biggest) {
            return "Yes";
        }

        return "No";
    }

}


