#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <utility>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <numeric>
#include <functional>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define exrep(i, a, b) for(ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;

ll n;
vl v;
vl e;
bool ok = false;

void check(vl &v) {
    vl vec(3);
    rep(i, n) {
        vec[v[i]] += e[i];
    }
    if(vec[0] == vec[1] && vec[1] == vec[2]) {
        ok = true;
    }
}

void dfs(ll depth) {
    if(depth == n) {
        check(v);
        return;
    }
    exrep(i, 0, 2) {
        v[depth] = i;
        dfs(depth + 1);
    }
}

int main() {

    cin >> n;

    e.resize(n);
    rep(i, n) {
        cin >> e[i];
    }

    v.resize(n);
    dfs(0);

    if(ok) {
        out("Yes");
    }
    else {
        out("No");
    }
    
    re0;
}