#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
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; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

ll n;
VL e;
ll nowa = 0,nowb = 0,nowc = 0;

bool rec(int i){
    if(i == n){
        if(nowa == nowb && nowb == nowc) return true;
        return false;
    }
    bool res = false;
    nowa += e[i];
    res |= rec(i+1);
    nowa -= e[i];
    nowb += e[i];
    res |= rec(i+1);
    nowb -= e[i];
    nowc += e[i];
    res |= rec(i+1);
    nowc -= e[i];
    return res;
}

int main(){
    cin >> n;
    e.resize(n);
    rep(i,n) cin >> e[i];
    if(rec(0)) out("Yes");
    else out("No");
}