#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void solve()
{	
	vector<vector<int>>a(4,vector<int>(4));
	pair<int,int> z;
	rep(i,4){
		rep(j,4){
			cin>>a[i][j];
			if(!a[i][j])z={i,j};
		}
	}
	vector<bool>used(15);
	int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
	while(true){
		bool flag=false;
		rep(i,4){
			int x=z.first+dx[i],y=z.second+dy[i];
			if(x>=0&&x<4&&y>=0&&y<4&&!used[a[x][y]-1]&&z.first*4+z.second+1==a[x][y]){
				used[a[x][y]-1]=true;
				swap(a[z.first][z.second],a[x][y]);
				z.first=x,z.second=y;
				flag=true;
				break;
			}
		}
		if(!flag)break;
	}

	bool ng=false;
	rep(i,4){
		rep(j,4){
			if(i==3&&j==3){
				if(a[i][j])ng=true;
			}
			else if(i*4+j+1!=a[i][j])ng=true;
		}
	}
	if(ng)cout<<"No\n";
	else cout<<"Yes\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}