import java.util.Scanner;
import java.lang.Math;
import java.util.ArrayList;
import java.util.List;
//List<String> color = new ArrayList<>();
//int[] n = new int[k];

class Main {
	static void swap(int[] a, int idx1, int idx2) {
		int t = a[idx1];
		a[idx1] = a[idx2];
		a[idx2] = t; 
	}
	static void quicksort(int[] a, int left, int right) {
		int pl = left;
		int pr = right;
		int x = a[(pl + pr) / 2];

		do {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		}	while (pl <= pr);

		if (left < pr)
			quicksort(a, left, pr);
		if (pl < right)
			quicksort(a, pl, right);
	}

	static void quicksort2(int[] a, int n) {
		quicksort(a, 0, n - 1);
	}

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] l = new int[n];
		for (int i = 0; i < n; i++)
			l[i] = stdIn.nextInt();
		quicksort2(l, n);
		int s = 0;
		for (int i = 0; i < n - 1; i++)
			s = s + l[i];

		String a = (s > l[n-1]) ? "Yes" : "No";
		System.out.println(a);
	}
} import java.util.Scanner; Scanner java.util import java.lang.Math; Math java.lang import java.util.ArrayList; ArrayList java.util import java.util.List; List java.util class Main {
	static void swap(int[] a, int idx1, int idx2) {
		int t = a[idx1];
		a[idx1] = a[idx2];
		a[idx2] = t; 
	}
	static void quicksort(int[] a, int left, int right) {
		int pl = left;
		int pr = right;
		int x = a[(pl + pr) / 2];

		do {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		}	while (pl <= pr);

		if (left < pr)
			quicksort(a, left, pr);
		if (pl < right)
			quicksort(a, pl, right);
	}

	static void quicksort2(int[] a, int n) {
		quicksort(a, 0, n - 1);
	}

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] l = new int[n];
		for (int i = 0; i < n; i++)
			l[i] = stdIn.nextInt();
		quicksort2(l, n);
		int s = 0;
		for (int i = 0; i < n - 1; i++)
			s = s + l[i];

		String a = (s > l[n-1]) ? "Yes" : "No";
		System.out.println(a);
	}
} Main static void swap(int[] a, int idx1, int idx2) {
		int t = a[idx1];
		a[idx1] = a[idx2];
		a[idx2] = t; 
	} swap {
		int t = a[idx1];
		a[idx1] = a[idx2];
		a[idx2] = t; 
	} int t = a[idx1]; t a[idx1] a idx1 a[idx1] = a[idx2] a[idx1] a idx1 a[idx2] a idx2 a[idx2] = t a[idx2] a idx2 t int[] a a int idx1 idx1 int idx2 idx2 static void quicksort(int[] a, int left, int right) {
		int pl = left;
		int pr = right;
		int x = a[(pl + pr) / 2];

		do {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		}	while (pl <= pr);

		if (left < pr)
			quicksort(a, left, pr);
		if (pl < right)
			quicksort(a, pl, right);
	} quicksort {
		int pl = left;
		int pr = right;
		int x = a[(pl + pr) / 2];

		do {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		}	while (pl <= pr);

		if (left < pr)
			quicksort(a, left, pr);
		if (pl < right)
			quicksort(a, pl, right);
	} int pl = left; pl left int pr = right; pr right int x = a[(pl + pr) / 2]; x a[(pl + pr) / 2] a (pl + pr) / 2 (pl + pr) pl pr 2 do {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		}	while (pl <= pr); pl <= pr pl pr {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		} while (a[pl] < x) pl++; a[pl] < x a[pl] a pl x pl++ pl while (a[pr] > x) pr--; a[pr] > x a[pr] a pr x pr-- pr if (pl <= pr)
				swap(a, pl++, pr--); pl <= pr pl pr swap(a, pl++, pr--) swap a pl++ pl pr-- pr if (left < pr)
			quicksort(a, left, pr); left < pr left pr quicksort(a, left, pr) quicksort a left pr if (pl < right)
			quicksort(a, pl, right); pl < right pl right quicksort(a, pl, right) quicksort a pl right int[] a a int left left int right right static void quicksort2(int[] a, int n) {
		quicksort(a, 0, n - 1);
	} quicksort2 {
		quicksort(a, 0, n - 1);
	} quicksort(a, 0, n - 1) quicksort a 0 n - 1 n 1 int[] a a int n n public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] l = new int[n];
		for (int i = 0; i < n; i++)
			l[i] = stdIn.nextInt();
		quicksort2(l, n);
		int s = 0;
		for (int i = 0; i < n - 1; i++)
			s = s + l[i];

		String a = (s > l[n-1]) ? "Yes" : "No";
		System.out.println(a);
	} main {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] l = new int[n];
		for (int i = 0; i < n; i++)
			l[i] = stdIn.nextInt();
		quicksort2(l, n);
		int s = 0;
		for (int i = 0; i < n - 1; i++)
			s = s + l[i];

		String a = (s > l[n-1]) ? "Yes" : "No";
		System.out.println(a);
	} Scanner stdIn = new Scanner(System.in); stdIn new Scanner(System.in) int n = stdIn.nextInt(); n stdIn.nextInt() stdIn.nextInt stdIn int[] l = new int[n]; l new int[n] n for (int i = 0; i < n; i++)
			l[i] = stdIn.nextInt(); int i = 0; int i = 0; i 0 i < n i n i++ i++ i l[i] = stdIn.nextInt(); l[i] = stdIn.nextInt() l[i] l i stdIn.nextInt() stdIn.nextInt stdIn quicksort2(l, n) quicksort2 l n int s = 0; s 0 for (int i = 0; i < n - 1; i++)
			s = s + l[i]; int i = 0; int i = 0; i 0 i < n - 1 i n - 1 n 1 i++ i++ i s = s + l[i]; s = s + l[i] s s + l[i] s l[i] l i String a = (s > l[n-1]) ? "Yes" : "No"; a (s > l[n-1]) ? "Yes" : "No" (s > l[n-1]) s l[n-1] l n-1 n 1 "Yes" "No" System.out.println(a) System.out.println System.out System System.out a String[] args args
import java.util.Scanner;
import java.lang.Math;
import java.util.ArrayList;
import java.util.List;
//List<String> color = new ArrayList<>();
//int[] n = new int[k];

class Main {
	static void swap(int[] a, int idx1, int idx2) {
		int t = a[idx1];
		a[idx1] = a[idx2];
		a[idx2] = t; 
	}
	static void quicksort(int[] a, int left, int right) {
		int pl = left;
		int pr = right;
		int x = a[(pl + pr) / 2];

		do {
			while (a[pl] < x) pl++;
			while (a[pr] > x) pr--;
			if (pl <= pr)
				swap(a, pl++, pr--);
		}	while (pl <= pr);

		if (left < pr)
			quicksort(a, left, pr);
		if (pl < right)
			quicksort(a, pl, right);
	}

	static void quicksort2(int[] a, int n) {
		quicksort(a, 0, n - 1);
	}

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);
		int n = stdIn.nextInt();
		int[] l = new int[n];
		for (int i = 0; i < n; i++)
			l[i] = stdIn.nextInt();
		quicksort2(l, n);
		int s = 0;
		for (int i = 0; i < n - 1; i++)
			s = s + l[i];

		String a = (s > l[n-1]) ? "Yes" : "No";
		System.out.println(a);
	}
}