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

typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int INF = (1<<30)-1;
const int MOD = 1e9+7;
const ll LINF = (1ll<<62)-1;

#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT16(x) cout << fixed << setprecision(16) << (x) << "\n";

int main(){
    //input
    int n;cin >> n;
    vector<int> e(n);
    int num = 0;
    REP(i,n){
        cin >> e[i];
        num += e[i];
    }
    if(num%3!=0){
        COUT("No");
        return 0;
    }
    //bit-search
    vector<int> vec1;
    for(int bit=0;bit<(1<<n);bit++){
        int num1 = 0;
        vec1.clear();
        for(int i=0;i<n;i++){
            if(bit&(1<<i)){
                num1 += e[i];
            }
            else vec1.push_back(e[i]);
        }
        if(num1==num/3)break;
    }
    bool flag = 0;
    for(int bit=0;bit<(1<<vec1.size());bit++){
        int num1 = 0;
        for(int i=0;i<vec1.size();i++){
            if(bit&(1<<i)){
                num1 += vec1[i];
            }
        }
        if(num1==num/3){
            flag = 1;
            break;
        }
    }
    if(flag)COUT("Yes");
    else COUT("No");
}