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

int main() {
    int n;
    cin >> n;
    vector<int> e(n);
    int sum = 0;
    rep(i, n) {
        cin >> e[i];
        sum += e[i];
    }
    if (sum % 3 != 0) {
        cout << "No" << endl;
        return 0;
    }
    sum /= 3;
    for (int i = 0; i < (1 << n); i++) {
        int pa = 0, pb = 0, pc = 0;
        set<int> st;
        vector<int> vec;
        for (int j = 0; j < n; j++) {
            if (i & (1 << j)) {
                pa += e[j];
                st.insert(j);
            }
        }
        if (pa != sum) continue;
        for (int j = 0; j < n; j++) {
            if (!st.count(j)) vec.push_back(j);
        }
        int m = vec.size();
        for (int j = 0; j < (1 << m); j++) {
            pb = 0;
            for (int k = 0; k < m; k++) {
                if (j & (1 << k)) {
                    pb += e[vec[k]];
                }
            }
            if (pb == sum) {
                cout << "Yes" << endl;
                return 0;
            }
        }
    }
    cout << "No" << endl;
}