#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
std::vector<bool> sieveOfEratosthenes(long long  n = 1000000) {
	std::vector<bool>p(n + 1, true);
	std::vector<long long>ret;
	p[0] = false;
	p[1] = false;
	for (int i = 2; i <= n; ++i) {
		if (!p[i]) continue;
		ret.push_back(i);
		for (int j = 2 * i; j <= n; j += i) p[j] = false;
	}
	return p;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	auto ps = sieveOfEratosthenes(10001001);
	int n; cin >> n;
	vector<int>a(n), b(n);
	rep(i, n)cin >> a[i] >> b[i];
	two_sat ts(n);
	// 0:st
	// 1:ts
	rep(i, n) rep2(j, i, n) {
		// 00
		{
			string s0 = to_string(a[i]) + to_string(b[j]);
			auto x0 = stoi(s0);
			string s1 = to_string(a[j]) + to_string(b[i]);
			auto x1 = stoi(s1);
			if (ps[x0] || ps[x1])ts.add_clause(i, true, j, true);
		}
		// 01
		{
			string s0 = to_string(a[i]) + to_string(a[j]);
			auto x0 = stoi(s0);
			string s1 = to_string(b[j]) + to_string(b[i]);
			auto x1 = stoi(s1);
			if (ps[x0] || ps[x1])ts.add_clause(i, true, j, false);
		}
		// 10
		{
			string s0 = to_string(b[i]) + to_string(b[j]);
			auto x0 = stoi(s0);
			string s1 = to_string(a[j]) + to_string(a[i]);
			auto x1 = stoi(s1);
			if (ps[x0] || ps[x1])ts.add_clause(i, false, j, true);
		}
		// 11
		{
			string s0 = to_string(b[i]) + to_string(a[j]);
			auto x0 = stoi(s0);
			string s1 = to_string(b[j]) + to_string(a[i]);
			auto x1 = stoi(s1);
			if (ps[x0] || ps[x1])ts.add_clause(i, false, j, false);
		}
	}
	cout << (ts.satisfiable() ? "Yes" : "No") << endl;
	return 0;
}