
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");
        
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz