#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <numeric>
#include <bitset>
#include <complex>
#define rep(x, to) for (int x = 0; x < (to); x++)
#define REP(x, a, to) for (int x = (a); x < (to); x++)
#define foreach(itr, x) for (typeof((x).begin()) itr = (x).begin(); itr != (x).end(); itr++)
#define EPS (1e-14)

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
typedef complex<double> Complex;
typedef vector< vector<int> > Mat;

int sy, sx;
bool used[20];
int a[5][5];

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

bool check() {
	rep(y, 4) rep(x, 4) {
		if (a[y][x] != (y * 4 + x + 1) % 16) return false;
	}
	return true;
}

bool dfs(int i, int j) {
	if (check()) return true;
	rep(k, 4) {
		int ny = i + dy[k];
		int nx = j + dx[k];
		if (ny < 0 || ny >= 4) continue;
		if (nx < 0 || nx >= 4) continue;
		if (used[a[ny][nx]]) continue;
		used[a[ny][nx]] = true;
		swap(a[i][j], a[ny][nx]);
		bool res = dfs(ny, nx);
		if (res) return res;
		swap(a[i][j], a[ny][nx]);
		used[a[ny][nx]] = false;
	}
	return false;
}

void solve() {
	if (dfs(sy, sx)) {
		cout << "Yes" << endl;
	} else {
		cout << "No" << endl;
	}
}

int main() {
	rep(i, 4) rep(j, 4) {
		cin >> a[i][j];
		if (a[i][j] == 0) {
			sy = i;
			sx = j;
		}
	}
	solve();
	return 0;
}