#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (int i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
#define SIZE(x) ll(x.size())
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
int N, ans;
vector<int> E(20);
vector<int> P(20);

void dfs(int n) {
    if (n == N) {
        vector<int> S(3);
        rep(i, N) {
            S[P[i]] += E[i];
        }
        if (S[0] == S[1] && S[1] == S[2]) ans++;
        return ;
    }
    rep(i, 3) {
        P[n] = i;
        dfs(n + 1);
    }
}
int main()
{
    cin >> N;
    rep(i, N) cin >> E[i];
    dfs(0);
    if (ans == 0) cout << "No" << endl;
    else cout << "Yes" << endl;
    return 0;
}