import java.util.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	}

} 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[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	}

} Main public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	} main {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	} Scanner sc=new Scanner(System.in); sc new Scanner(System.in) int N=sc.nextInt(); N sc.nextInt() sc.nextInt sc int[]x=new int[N]; x new int[N] N int max=0; max 0 int sum=0; sum 0 for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		} int i=0; int i=0; i 0 i<N i N i++ i++ i {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		} {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		} int L=sc.nextInt(); L sc.nextInt() sc.nextInt sc x[i]=L x[i] x i L sum+=x[i] sum x[i] x i max=x[0] max x[0] x 0 for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
} int j=1; int j=1; j 1 j<N j N j++ j++ j {
	if(max<x[j]) {
		max=x[j];
	}
	
} {
	if(max<x[j]) {
		max=x[j];
	}
	
} if(max<x[j]) {
		max=x[j];
	} max<x[j] max x[j] x j {
		max=x[j];
	} max=x[j] max x[j] x j if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
} max<sum-max max sum-max sum max {
	System.out.print("Yes");
} System.out.print("Yes") System.out.print System.out System System.out "Yes" if(max>=sum-max) {
	System.out.print("No");
} max>=sum-max max sum-max sum max {
	System.out.print("No");
} System.out.print("No") System.out.print System.out System System.out "No" sc.close() sc.close sc String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	}

} public class Main {

	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		int[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	}

} 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[]x=new int[N];
		int max=0; int sum=0;
		for(int i=0;i<N;i++) {
			int L=sc.nextInt();
            x[i]=L;
            sum+=x[i];
		}
		max=x[0];
for(int j=1;j<N;j++) {
	if(max<x[j]) {
		max=x[j];
	}
	
}
if(max<sum-max) {
	System.out.print("Yes");
}
else if(max>=sum-max) {
	System.out.print("No");
}
		sc.close();
	}

}
