#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define rep(i,n) for(int i=0; i<(n); i++)
#define INF ((1LL<<62)-(1LL<<31))
#define all(a)  (a).begin(),(a).end()
#define rall(a)  (a).rbegin(),(a).rend()
typedef long long ll;
typedef pair<ll,ll> pl;
typedef tuple<ll,ll,ll> tupl;



int main()
{
    int n;
    cin >> n;
    vector<ll> e(n);
    ll sum=0;
    rep(i,n) {
        cin >> e[i];
        sum+=e[i];
    }
    bool flag=false;
    if(sum%3==0) {
        for(int bit1=0;bit1<(1<<n);bit1++) {
            ll tot=0;
            vector<ll> v;
            rep(i,n) if(1<<i&bit1) {
                tot+=e[i];
            } else v.push_back(e[i]);
            if(tot!=sum/3) continue;
            int x=v.size();
            for(int bit2=0;bit2<(1<<x);bit2++) {
                ll tot2=0;
                rep(i,x) if(1<<i&bit2) tot2+=v[i];
                if(tot2==tot) flag=true;
            }
            if(flag) break;
        }
    } 
    if(flag) cout << "Yes" << endl;
    else cout << "No" << endl;
    
    return 0;
}