#include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif

//#define int long long
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(c) begin(c),end(c)
const int INF = sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1'000'000'007;
template<class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return true; } return false; }

// n*nパズルが解けるかどうか
// 転倒数は O(m^2) で求めている
// 空きは m - 1 で表現する
bool solvable(const vector<int> &v, int n) {
	int m = v.size();
	int cnt = 0;
	for (int i = 0; i < m; i++) {
		for (int j = i + 1; j < m; j++) {
			if (v[i] == m - 1 || v[j] == m - 1)continue;
			if (v[i] > v[j])
				cnt++;
		}
	}
	int s = find(v.begin(), v.end(), m - 1) - v.begin();
	int si = s / n, sj = s % n;
	return cnt % 2 == (n - 1 - si + n - 1 - sj) % 2;
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	vector<int> v(16);
	rep(i, 0, 16) {
		cin >> v[i];
		v[i]--;
		if (v[i] < 0)v[i] = 15;
	}
	bool yes = solvable(v, 4);
	rep(i, 0, 4)rep(j, 0, 4) {
		int ni = v[i * 4 + j] / 4, nj = v[i * 4 + j] % 4;
		int d = abs(i - ni) + abs(j - nj);
		if (d > 1)
			yes = false;
	}
	if (yes) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
	return 0;
}