import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    private static final String YES = "Yes";
    private static final String NO = "No";

    public static void main(String[] args) {
        TestCase testCase = readFromInput();

        final String result = process(testCase);

        output(result);
    }

    private static TestCase readFromInput() {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        List<Integer> L = new ArrayList<>();
        for (int i = 0; i < N; ++i) {
            L.add(sc.nextInt());
        }

        sc.close();
        return new TestCase(N, L);
    }

    public static String process(TestCase testCase) {
        List<Integer> L = testCase.L;

        int largest = 0;
        int sum = 0;

        for (int side : L) {
            largest = Math.max(largest, side);
            sum += side;
        }

        return (largest < (sum - largest)) ? YES : NO;
    }

    private static void output(String result) {
        System.out.println(result);
    }

    public static class TestCase {
        final int N;
        final List<Integer> L;

        public TestCase(int N, List<Integer> L) {
            this.N = N;
            this.L = L;
        }
    }
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz