#include <bits/stdc++.h>
using namespace std;
using ll = long long;

template<class T> istream& operator >> (istream& is, vector<T>& vec) {
    for(T& x : vec) is >> x;
    return is;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int N;
    cin >> N;
    vector<int> A(N);
    cin >> A;
    sort(A.begin(), A.end());

    ll s = accumulate(A.begin(), A.end(), 0ll);
    int l = 0, r = N - 1;
    auto f = [&](int p){
        if(l != 0 || r != N - 1){
            if(A[l] <= 0 || A[r] <= 0){
                cout << "Yes\n";
                exit(0);
            }
            if(A[l] >= 0 || A[r] >= 0){
                cout << "Yes\n";
                exit(0);
            }
        }
        if(A[p] >= 0 && s - A[p] <= 0) return;
        if(A[p] <= 0 && s - A[p] >= 0) return;
        cout << "No\n";
        exit(0);
    };
    while(l < r){
        if(s == 0){
            if(abs(A[l]) >= abs(A[r])){
                f(l);
                s -= A[l++];
            }else{
                f(r);
                s -= A[r--];
            }
        }else if(s > 0){
            f(r);
            s -= A[r--];
        }else{
            f(l);
            s += A[l++];
        }
    }
    cout << "Yes\n";
}