#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)x.size())
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
  }*/

int a[16], ans[16];
bool used[16];

bool check(int a[]){
  rep(i, 0, 16) if(a[i] != i) return false;
  return true;
}

void dfs(){
  if(check(a)){
    rep(i, 0, 16) ans[i] = a[i];
    return;
  }

  int zero;
  rep(i, 0, 16) if(a[i] == 15) zero = i;

  if(zero-4 >= 0 and !used[a[zero-4]]){
    used[a[zero-4]] = true;
    swap(a[zero], a[zero-4]);
    dfs();
    swap(a[zero], a[zero-4]);
    used[a[zero-4]] = false;
  }
  if(zero+4 < 16 and !used[a[zero+4]]){
    used[a[zero+4]] = true;
    swap(a[zero], a[zero+4]);
    dfs();
    swap(a[zero], a[zero+4]);
    used[a[zero+4]] = false;
  }
  if(zero%4 >= 1 and !used[a[zero-1]]){
    used[a[zero-1]] = true;
    swap(a[zero], a[zero-1]);
    dfs();
    swap(a[zero], a[zero-1]);
    used[a[zero-1]] = false;
  }
  if(zero%4 < 3 and !used[a[zero+1]]){
    used[a[zero+1]] = true;
    swap(a[zero], a[zero+1]);
    dfs();
    swap(a[zero], a[zero+1]);
    used[a[zero+1]] = false;
  }
}

signed main(){
  rep(i, 0, 16){
    cin >> a[i];
    a[i] = (a[i] + 15) %16;
  }

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

  return 0;
}