#include <bits/stdc++.h>
using namespace std;
#define all(c) (c).begin(),(c).end()
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define iter(c) __typeof((c).begin())
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
#define mem(a) memset(a,0,sizeof(a))
#define pb(a) push_back(a)
#define in(a) insert(a)
#define R cin>>
#define F first
#define S second
#define C class
#define ll long long
#define ln cout<<'\n'
#define _(_1,_2,_3,N,...)N
#define pr(...) _(__VA_ARGS__,pr3,pr2,pr1)(__VA_ARGS__)
template<C T>void pr1(T a){cout<<a;ln;}
template<C T,C T2>void pr2(T a,T2 b){cout<<a<<' '<<b;ln;}
template<C T,C T2,C T3>void pr3(T a,T2 b,T3 c){cout<<a<<' '<<b<<' '<<c;ln;}
template<C T>void PR(T a,int n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
bool check(int n,int m,int x,int y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;


void Main() {
  int a[4][4],nx,ny;
  rep(i,4) {
    rep(j,4) {
      cin >> a[i][j];
      if(!a[i][j]) nx=i,ny=j;
    }
  }
  bool ck=1,b[4][4];
  mem(b);
  rep(t,16) {
    rep(i,4) {
      int x=nx+dx[i],y=ny+dy[i];
      if(check(4,4,x,y) && a[x][y]==(nx*4+ny+1) && !b[x][y]) {
	swap(a[x][y],a[nx][ny]);
	nx=x,ny=y;
	b[x][y]=1;
	break;
      }
    }
  }
  rep(i,4) {
    rep(j,4) {
      int d=i*4+j+1;
      if(d<16 && a[i][j]!=d) ck=0;
    }
  }
  if(ck) pr("Yes");
  else pr("No");
}

int main() {
  ios::sync_with_stdio(0);cin.tie(0);Main();
  return 0;
}