#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (long long i = 0LL; i < (long long)(n); i++)
const long long INF = 2e18;

// 最小二乗法を用いて base^exp を求めます。
template <typename T, typename U>
long long pows(T base, U exp) {
    ll ret = 1;
    while (exp != 0) {
        if (exp & 1) {
            ret *= base;
        }
        base *= base;
        exp >>= 1;
    }
    return ret;
}

int main(void) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N;
    cin >> N;
    vector<ll> E(N);
    rep(i, N) cin >> E[i];

    ll t = pows(3, N);
    rep(i, t) {
        vector<ll> arr(3);
        ll u = i;
        rep(j, N) {
            arr.at(u % 3) += E.at(j);
            u /= 3;
        }
        if (arr.at(0) == arr.at(1) && arr.at(0) == arr.at(2)) {
            cout << "Yes\n";
            exit(0);
        }
    }
    cout << "No\n";
}