#include<bits/stdc++.h>
#include<unordered_map>
#include<unordered_set>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
using PII = pair<int, int>;
using TP = tuple<int, int, int>;
#define all(x) x.begin(),x.end()
#define mk make_pair
//#define int LL
//#define lc p*2
//#define rc p*2+1
#define endl '\n'
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
//#pragma warning(disable : 4996)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
const double eps = 1e-8;
const LL MOD = 1000000007;
const LL mod = 998244353;
const int maxn = 100010;

int N, A[maxn];

bool isprime(int x)
{
	if (x == 1 || x == 0)
		return true;
	for (int i = 2; i * i <= x; i++)
	{
		if (x % i == 0)
			return false;
	}

	return true;
}

void solve()
{
	if (N == 1)
	{
		if (isprime(A[1]))
			cout << "No" << endl;
		else
			cout << "Yes" << endl;
		return;
	}
	int odd = 0, one = 0, two = 0;
	int onum;
	for (int i = 1; i <= N; i++)
	{
		if (A[i] % 2 == 0 && A[i] != 2)
		{
			cout << "Yes" << endl;
			return;
		}
		if (A[i] % 2)
		{
			odd++;
			onum = A[i];
		}
		if (A[i] == 2)
			two++;
		if (A[i] == 1)
			one++;
	}
	if (odd >= 2 && one < odd)
	{
		cout << "Yes" << endl;
		return;
	}
	if (one > 3)
	{
		cout << "Yes" << endl;
		return;
	}
	if (two >= 2 || two >= 1 && one >= 2)
	{
		cout << "Yes" << endl;
		return;
	}
	if (two == 1 && odd == 1 && !isprime(2 + onum))
	{
		cout << "Yes" << endl;
		return;
	}
	cout << "No" << endl;
}

int main()
{
	IOS;
	cin >> N;
	for (int i = 1; i <= N; i++)
		cin >> A[i];
	solve();

	return 0;
}