#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
int a[4][4];
bool isover(int y,int x){
	return (x<0 || y<0 || x>=4 || y>=4);
}
bool isend(){
	bool f=true;
	REP(i,4)REP(j,4){if(!(i==3 && j==3) && a[i][j]!=4*i+j+1) f=false;}
	return f;
}
int main(){
	REP(i,4)REP(j,4) cin>>a[i][j];
	bool f=true;
	while(true){
		if(isend() ) break;
		int ki=0,kj=0;
		REP(i,4)REP(j,4) if(a[i][j]==0) ki=i,kj=j;
		int dx[4]={1,0,-1,0};
		int dy[4]={0,1,0,-1};
		bool check=true;
		REP(i,4){
			if(isover(ki+dy[i],kj+dx[i])) continue;
			int ny=ki+dy[i],nx=kj+dx[i];
			if(a[ny][nx]==ki*4+(kj+1)){swap(a[ki][kj],a[ny][nx]);check=false;}
		}
		if(check){f=false;break;}
	}
	if(f) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	return 0;
}