#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic pop
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

bool is_prime[1000000];
bool ok[1000][1000];

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  for(int p = 2; p < 1000000; p++) is_prime[p] = true;
  for(int p = 2; p < 1000000; p++) if (is_prime[p]) {
    for(int q = 2 * p; q < 1000000; q += p) is_prime[q] = false;
  }
  for(int x = 1; x < 1000; x++) {
    for(int y = 1; y < 1000; y++) {
      ok[x][y] = !is_prime[stoi(to_string(x) + to_string(y))];
    }
  }
  int n;
  cin >> n;
  VI a(n), b(n);
  rep(i, n) cin >> a[i] >> b[i];
  two_sat ts(n);
  rep(i, n) rep(bi, 2) {
    if (!ok[a[i]][b[i]]) {
      ts.add_clause(i, !bi, i, !bi);
    }
    swap(a[i], b[i]);
  }
  rep(i, n) rep(j, i) {
    rep(bi, 2) {
      rep(bj, 2) {
        if (!ok[a[i]][b[j]] || !ok[a[j]][b[i]]) {
          ts.add_clause(i, !bi, j, !bj);
        }
        swap(a[j], b[j]);
      }
      swap(a[i], b[i]);
    }
  }
  cout << (ts.satisfiable() ? "Yes\n" : "No\n");
}