#include <bits/stdc++.h>
using namespace std;

#define lp(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) lp(i, 0, n)
#define rlp(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define rrep(i, n) rlp(i, 0, n)

#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(c) begin(c), end(c)

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};

typedef long long ll;
typedef unsigned long long ull;

template<typename T>
inline void unique(T &c){
	sort(all(c));
	c.erase(unique(all(c)), end(c));
}

int a[4][4];
int t[4][4] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0};

int main()
{
	rep(i, 4) rep(j, 4) cin >> a[i][j];
	
	int x, y;
	rep(i, 4) rep(j, 4){
		if (a[i][j] == 0){
			x = i, y = j;
		}
	}

	while (true){
		bool update = false;
		for (int d = 0; d < 4; d++){
			int nx = x + dx[d];
			int ny = y + dy[d];
			if (nx < 0 || nx >= 4 || ny < 0	|| ny >= 4) continue;
			if (a[nx][ny] == t[x][y]){
				swap(a[nx][ny], a[x][y]);
				x = nx, y = ny;
				update = true;
				break;
			}
		}
		if (!update) break;
	}

	if (vector<int>(*a, *a + 16) == vector<int>(*t, *t + 16)){
		cout << "Yes\n";
	}
	else cout << "No\n";
}