#include <bits/stdc++.h>

using namespace std;

#define fastIOI ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define vc vector
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define all(x) x.begin(),x.end()

const int N = 1e5 + 5;
int a[N], n;

void IOI() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
	    cin >> a[i];
	}
	if (n >= 4) {
	    cout << "Yes";
	    return;
	}
	int cntcomp = 0, cnt1 = 0;
	for (int i = 1; i <= n; i++) {
	    if (a[i] == 1) {
	        cnt1++;
	        continue;
	    }
		bool prime = 1;
		for (int j = 2; j * j <= a[i]; j++) {
		    if (a[i] % j == 0) prime = 0;
		}
		if (!prime) cntcomp = 1;
	}
	if (cntcomp) cout << "Yes";
	else {
		if (cnt1 == n) {
			cout << "No";
		}
		else {
			if (cnt1 == 1) cout << "Yes";
			else {
				if (n == 1) cout << "No";
				else cout << "Yes";
			}
		}
	}
}

signed main() {
	fastIOI;
	//freopen("exam.in","r",stdin);
    //freopen("exam.out","w",stdout);
	int tt = 1;
	//cin >> tt;
	while ( tt-- ) {
		IOI();
		cout << '\n';
	}
}