import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    }
} Main public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    } main {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    } Scanner scan = new Scanner(System.in); scan new Scanner(System.in) int n = scan.nextInt(); n scan.nextInt() scan.nextInt scan int lengths[] = new int[n]; lengths new int[n] n for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        } int i = 0; int i = 0; i 0 i < lengths.length i lengths.length lengths lengths.length i++ i++ i {
            lengths[i] = scan.nextInt();
        } {
            lengths[i] = scan.nextInt();
        } lengths[i] = scan.nextInt() lengths[i] lengths i scan.nextInt() scan.nextInt scan int longestID longestID othersSum; othersSum longestID = 0 longestID 0 for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        } int i = 1; int i = 1; i 1 i < lengths.length i lengths.length lengths lengths.length i++ i++ i {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        } {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        } if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            } lengths[i] >= lengths[longestID] lengths[i] lengths i lengths[longestID] lengths longestID {
                longestID = i;
            } longestID = i longestID i othersSum = 0 othersSum 0 for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        } int i = 0; int i = 0; i 0 i < lengths.length i lengths.length lengths lengths.length i++ i++ i {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        } {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        } if(i != longestID) {
                othersSum += lengths[i];
            } i != longestID i longestID {
                othersSum += lengths[i];
            } othersSum += lengths[i] othersSum lengths[i] lengths i if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        } lengths[longestID] < othersSum lengths[longestID] lengths longestID othersSum {
            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" scan.close() scan.close scan return; String[] args args public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    }
} public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    }
} Main
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int lengths[] = new int[n];
        for(int i = 0; i < lengths.length; i++) {
            lengths[i] = scan.nextInt();
        }
        int longestID, othersSum;

        longestID = 0;
        for(int i = 1; i < lengths.length; i++) {
            if(lengths[i] >= lengths[longestID]) {
                longestID = i;
            }
        }

        othersSum = 0;
        for(int i = 0; i < lengths.length; i++) {
            if(i != longestID) {
                othersSum += lengths[i];
            }
        }

        if(lengths[longestID] < othersSum) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }
        scan.close();
        return;
    }
}