//Polygon.java
import java.util.Scanner;
class Main
{
	public static void main(String args[])
	{
		Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int l[]=new int[n];
		for(int i=0; i<n; i++){
            l[i]=sc.nextInt();
        }
        int sum=0;
        int ans=0;
        int max=l[0];
        for(int i=0; i<n; i++){
                if(l[i]>max){
                    max=l[i];
                }
        }  
        
        for(int i=0; i<n; i++){
            ans+=l[i];
        }
        sum=ans-max;
        //System.out.println(ans);
        //System.out.println(sum);
        if(sum>max){
            System.out.println("Yes");
        }
        else{
            System.out.println("No");
        }
        sc.close();
    }
}
/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