#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn           \
    { puts("YES"); } \
    else {           \
        puts("NO");  \
    }
#define MAX_N 200005

int main() {
    int n;
    cin >> n;
    int a[n] = {};
    rep(i, n) cin >> a[i];
    int th = 1;
    rep(i, n) th *= 3;
    rep(i, th) {
        int ii   = i;
        int f[n] = {};
        rep(j, n) {
            f[j] = ii % 3;
            ii /= 3;
        }
        int b[3] = {};
        rep(j, n) { b[f[j]] += a[j]; }
        if (b[0] == b[1] && b[1] == b[2]) { cout << "Yes" << endl; }
    }
    cout << "No" << endl;
    return 0;
}