import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

} import java.util.Arrays; Arrays java.util import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	} main {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = Integer.parseInt(sc.next()); n Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] L = new int [n]; L new int [n] n for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		} int i=0; int i=0; i 0 i<n i n i++ i++ i {
			L[i] = Integer.parseInt(sc.next());
		} {
			L[i] = Integer.parseInt(sc.next());
		} L[i] = Integer.parseInt(sc.next()) L[i] L i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc sc.close() sc.close sc Arrays.sort(L) Arrays.sort Arrays L int max = L[n-1]; max L[n-1] L n-1 n 1 int sum = 0; sum 0 for(int i=0;i<n-1;i++) {
			sum += L[i];
		} int i=0; int i=0; i 0 i<n-1 i n-1 n 1 i++ i++ i {
			sum += L[i];
		} {
			sum += L[i];
		} sum += L[i] sum L[i] L i if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		} max < sum max sum {
			System.out.println("Yes");
		} System.out.println("Yes") System.out.println System.out System System.out "Yes" {
			System.out.println("No");
		} System.out.println("No") System.out.println System.out System System.out "No" String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

} Main
import java.util.Arrays;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = Integer.parseInt(sc.next());
		int[] L = new int [n];

		for(int i=0;i<n;i++) {
			L[i] = Integer.parseInt(sc.next());
		}
		sc.close();
		Arrays.sort(L);
		int max = L[n-1];
		int sum = 0;
		for(int i=0;i<n-1;i++) {
			sum += L[i];
		}
		if(max < sum) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

}
