#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;
    vector<int> r(n);
    rep(i, n) r[i] = i;
    do {
        int pa = 0, pb = 0, pc = 0;
        int i = 0;
        while (pa < sum && i < n) {
            pa += e[r[i]];
            i++;
        }
        if (pa != sum) continue;
        while (pb < sum && i < n) {
            pb += e[r[i]];
            i++;
        }
        if (pb != sum) continue;
        while (pc < sum && i < n) {
            pc += e[r[i]];
            i++;
        }
        if (pc != sum) continue;
        cout << "Yes" << endl;
        return 0;
    } while (next_permutation(r.begin(), r.end()));
    cout << "No" << endl;
}