import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    }
}
/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