#include <bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define sz(x) (int)x.size()

const int N = 1e5 + 200;

int n, a[N];
bool check(long long x) {
    for (long long i = 2; i * i <= x; ++i) {
        if (x % i == 0) {
            return true;
        }
    }
    return false;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    int cnt1 = 0, cnt2 = 0, odd = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        cnt1 += a[i] == 1;
        cnt2 += a[i] == 2;
        odd += (a[i] % 2 == 1 && a[i] > 1);
    }
    for (int i = 1; i <= n; ++i) {
        if (a[i] > 2 && a[i] % 2 == 0) {
            cout << "Yes\n";
            return 0;
        }
        if (cnt1 > 0 && a[i] > 2 && a[i] % 2 == 1) {
            cout << "Yes\n";
            return 0;
        }
    }
    if (cnt2 > 1 || cnt1 > 3 || odd > 1) {
        cout << "Yes\n";
        return 0;
    }
    assert(n <= 5);
    for (int mask = 1; mask < (1<<n); ++mask) {
        long long sum = 0;
        for (int i = 0; i < n; ++i) {
            if ((mask >> i) & 1) {
                sum += a[i];
            }
        }
        if (check(sum)) {
            cout << "Yes\n";
            return 0;
        }
    }
    cout << "No\n";
    return 0;
}