
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;

class Main {

    static final int MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] ren = new int[N];
        int sum = 0;
        for (int i = 0; i < N; i++) {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        }
        int longest = 0;
        for (int i = 0; i < N; i++) {
            if(longest<ren[i])longest=ren[i];
        }
        if(sum-longest>longest)
        System.out.println("Yes");
        else
        System.out.println("No");
        
    }
} import java.util.ArrayList; ArrayList java.util import java.util.Collection; Collection java.util import java.util.Collections; Collections java.util import java.util.Scanner; Scanner java.util class Main {

    static final int MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] ren = new int[N];
        int sum = 0;
        for (int i = 0; i < N; i++) {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        }
        int longest = 0;
        for (int i = 0; i < N; i++) {
            if(longest<ren[i])longest=ren[i];
        }
        if(sum-longest>longest)
        System.out.println("Yes");
        else
        System.out.println("No");
        
    }
} Main static final int MOD = 1000000007; MOD 1000000007 public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] ren = new int[N];
        int sum = 0;
        for (int i = 0; i < N; i++) {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        }
        int longest = 0;
        for (int i = 0; i < N; i++) {
            if(longest<ren[i])longest=ren[i];
        }
        if(sum-longest>longest)
        System.out.println("Yes");
        else
        System.out.println("No");
        
    } main {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] ren = new int[N];
        int sum = 0;
        for (int i = 0; i < N; i++) {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        }
        int longest = 0;
        for (int i = 0; i < N; i++) {
            if(longest<ren[i])longest=ren[i];
        }
        if(sum-longest>longest)
        System.out.println("Yes");
        else
        System.out.println("No");
        
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int[] ren = new int[N]; ren new int[N] N int sum = 0; sum 0 for (int i = 0; i < N; i++) {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        } {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        } ren[i] = sc.nextInt() ren[i] ren i sc.nextInt() sc.nextInt sc sum+=ren[i] sum ren[i] ren i int longest = 0; longest 0 for (int i = 0; i < N; i++) {
            if(longest<ren[i])longest=ren[i];
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            if(longest<ren[i])longest=ren[i];
        } {
            if(longest<ren[i])longest=ren[i];
        } if(longest<ren[i])longest=ren[i]; longest<ren[i] longest ren[i] ren i longest=ren[i] longest ren[i] ren i if(sum-longest>longest)
        System.out.println("Yes");
        else
        System.out.println("No"); sum-longest>longest sum-longest sum longest longest System.out.println("Yes") System.out.println System.out System System.out "Yes" System.out.println("No") System.out.println System.out System System.out "No" String[] args args

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;

class Main {

    static final int MOD = 1000000007;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int[] ren = new int[N];
        int sum = 0;
        for (int i = 0; i < N; i++) {
            ren[i] = sc.nextInt();
            sum+=ren[i];
        }
        int longest = 0;
        for (int i = 0; i < N; i++) {
            if(longest<ren[i])longest=ren[i];
        }
        if(sum-longest>longest)
        System.out.println("Yes");
        else
        System.out.println("No");
        
    }
}