#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int main(){
	bool mv[16]={};
	int a[4][4];
	rep(y,4)rep(x,4)cin>>a[y][x];
	char *ans="Yes";
	rep(i,16)rep(y,4)rep(x,4){
		int d=a[y][x];
		if(d==0)continue;
		d--;
		int dy,dx;
		dy=d/4;
		dx=d%4;
		if(abs(dy-y)+abs(dx-x)==1 && !mv[d] && a[dy][dx]==0){
			a[dy][dx]=d+1;
			a[y][x]=0;
			mv[d]=true;
		}
		
	}
	rep(y,4)rep(x,4){
		int d=a[y][x];
		if(d==0)continue;
		d--;
		int dy,dx;
		dy=d/4;
		dx=d%4;
		if(y!=dy||x!=dx){
			ans="No";
		}
		
	}

	cout<<ans<<endl;
	return 0;
}