#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

const int N = 4;
int a[4][4];
bool vis[4][4];

bool dfs(int i, int j) {
	if(vis[i][j]) return false;
	vis[i][j] = true;

	bool ok = true;
	rep(k, N) rep(l, N)
		ok &= a[k][l] == (k * 4 + l + 1) % 16;
	if(ok) return true;

	static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
	rep(d, 4) {
		int yy = i + dy[d], xx = j + dx[d];
		if(yy<0||yy>=N||xx<0||xx>=N) continue;
		swap(a[i][j], a[yy][xx]);
		if(dfs(yy, xx)) return true;
		swap(a[i][j], a[yy][xx]);
	}

	vis[i][j] = false;
	return false;
}

int main() {
	while(1) {
	rep(i, N) rep(j, N)
		if(!(cin >> a[i][j])) return 0;
	mset(vis, 0);
	rep(i, N) rep(j, N) if(a[i][j] == 0) {
		bool ans = dfs(i, j);
		puts(ans ? "Yes" : "No");
		goto aa;
	}
	aa:;
	}
	return 0;
}