import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	}
} import java.util.Collections; Collections java.util import java.util.Comparator; Comparator java.util import java.util.LinkedList; LinkedList java.util import java.util.Scanner; Scanner java.util public class Main {


	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	}
} Main public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	} main {
		Scanner scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	} Scanner scan = new Scanner(System.in); scan new Scanner(System.in) LinkedList<Integer> len = new LinkedList<Integer>(); len new LinkedList<Integer>() int num = scan.nextInt(); num scan.nextInt() scan.nextInt scan for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		} int i = 0; int i = 0; i 0 i < num i num i++ i++ i {
			len.add(scan.nextInt());
		} {
			len.add(scan.nextInt());
		} len.add(scan.nextInt()) len.add len scan.nextInt() scan.nextInt scan Collections.sort(len, Comparator.reverseOrder()) Collections.sort Collections len Comparator.reverseOrder() Comparator.reverseOrder Comparator int maxLen = len.poll(); maxLen len.poll() len.poll len int sum = 0; sum 0 while(len.size() > 0){
			sum += len.poll();
		} len.size() > 0 len.size() len.size len 0 {
			sum += len.poll();
		} sum += len.poll() sum len.poll() len.poll len if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		} maxLen < sum maxLen 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 scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	}
} public class Main {


	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	}
} Main
import java.util.Collections;
import java.util.Comparator;
import java.util.LinkedList;
import java.util.Scanner;

public class Main {


	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		LinkedList<Integer> len = new LinkedList<Integer>();

		// input
		int num = scan.nextInt();
		for(int i = 0; i < num; i++){
			len.add(scan.nextInt());
		}

		// sort
		Collections.sort(len, Comparator.reverseOrder());
		int maxLen = len.poll();

		// sum & avg
		int sum = 0;
		while(len.size() > 0){
			sum += len.poll();
		}

		if(maxLen < sum){
			System.out.println("Yes");
		} else {
			System.out.println("No");
		}


	}
}
