#include "bits/stdc++.h"

#define rep(i,n) for(int i = 0;i < n;i++)
#define REP(i,n,k) for(int i = n;i < k;i++)
#define P(p) cout << (p) << endl;
#define sP(p) cout << setprecision(15) << fixed << p << endl;
#define pi 3.1415926535
#define IINF 1e9
#define LINF 1e18
#define vi vector<int>
#define mp make_pair
#define pb push_back

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

unsigned long long sttoi(std::string str) {
	unsigned long long ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

ull gcd(ull a, ull b) {
	if (b > a)swap(a, b);
	if (b == 0) return a;
	return gcd(b, a%b);
}
int comp[4][4] =
{{1,2,3,4},
 {5,6,7,8},
 {9,10,11,12},
 {13,14,15,0}};
int a[4][4];
bool u[4][4];
bool dfs(){
  bool gap = true;
  rep(i,4){
    rep(j,4){
      if(comp[i][j] != a[i][j])gap = false;
    }
  }
  if(gap)return true;
  rep(i,4)rep(j,4){
    if(!a[i][j]){
      u[i][j] = true;
      rep(k,4){
        int nx = j+dx[k];
        int ny = i+dy[k];
        if(nx >= 0 && nx < 4 && ny >= 0 && ny < 4){
          if(u[ny][nx])continue;
          swap(a[i][j],a[ny][nx]);
          if(dfs())return true;
          swap(a[i][j],a[ny][nx]);
        }
      }
      u[i][j] = false;
    }
  }
  return false;
}

void solve() {
  rep(i,4){
    rep(j,4){
      u[i][j] = false;
      cin >> a[i][j];
    }
  }
  P(dfs()?"Yes":"No");
}

int main() {
  solve();
  return 0;
}