#include <iostream>
#include <iomanip>
#include <cstdio>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <algorithm>
#include <cctype>
#include <cmath>
#include <bitset>
#include <set>
#include <stack>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define RREP(i,n) for(int i=n-1;i>=0;i--)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);i++)
#define all(i,n) (i),(i+n)

int dx4[4]={1,0,-1,0};
int dy4[4]={0,-1,0,1};
int dx8[8]={1,0,-1,1,-1,1,0,-1};
int dy8[8]={1,1,1,0,0,-1,-1,-1};
int dx9[9]={0,1,0,-1,1,-1,1,0,-1};
int dy9[9]={0,1,1,1,0,0,-1,-1,-1};

typedef pair<int, int> P;
typedef pair<string, int> SP;
typedef long long ll;
typedef pair<ll, ll> PLL;

const int INF = 1e9;
const ll LLINF = 1e18;
const int MAX_V = 1e6+1;
const ll mod = 1000000007;
// << fixed << setprecision
// --------------------------------------
int a[4][4];
int b[4][4];

bool grid_inside(int y, int x) {
  if(0 <= y && y < 4 && 0 <= x && x < 4) return true;
  else return false;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  REP(i, 4) REP(j, 4) b[i][j] = i * 4 + j + 1;
  b[3][3] = 0;
  REP(i, 4) REP(j, 4) cin >> a[i][j];

  int y = 3, x = 3;

  bool f = true;
  while(f) {
    f = false;
    REP(i, 4) {
      int ny = y + dy4[i];
      int nx = x + dx4[i];
      if(grid_inside(ny, nx) && b[ny][nx] == a[y][x]) {
        swap(b[ny][nx], b[y][x]);
        y = ny; x = nx;
        f = true;
        break;
      }
    }
  }

  bool ans = true;
  REP(i, 4) REP(j, 4) {
    if(a[i][j] != b[i][j]) ans = false;
  }

  cout << (ans ? "Yes" : "No") << endl;
}