#include<bits/stdc++.h>

using namespace std;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()

using ll = long long;

const int N = 101;
const int R = 1e4 + 1;

int dp[N][N * R], r[N];

void solve() {
    dp[0][0] = 1;

    int n;
    cin >> n;

    if (n & 1) {
        cout << "No\n";
        return;
    }

    int sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> r[i];
        sum += r[i];
    }

    if (sum & 1) {
        cout << "No\n";
        return;
    }

    int need = sum / 2;

    sum = 0;

    for (int i = 0; i < n; i++) {
        int ri = r[i];
        for (int j = i; j >= 0; j--) {
            for (int l = 0; l <= sum; l++) {
                dp[j + 1][l + ri] += dp[j][l];
                dp[j + 1][l + ri] = min(dp[j + 1][l + ri], 2);
            }
        }
        sum += ri;
    }
    bool ok = 0;
    for (int i = 2; i < n; i += 2) {
        if (dp[i][need] == 2) {
            ok = true;
        }
    }

    cout << (ok ? "Yes" : "No") << '\n';
}

int main() {
#ifndef LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#else
    freopen("input.txt", "r", stdin);
#endif
    solve();
    return 0;
}