#include "bits/stdc++.h"
#include <unordered_set>

#define _CRT_SECURE_NO_WARNINGS

#define FOR(i, x, n) for(decltype(x) i = (x); i < (n); i++)
#define REP(i, n) for(decltype(n) i = 0; i < (n); i++)
#define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--)

#define ALL(a) (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define DESCSORT(c) sort(c.begin(), c.end(), greater<int>())

using namespace std;

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

using LL = long long int;
using LD = long double;

const int INF = (1 << 30) - 1;
const LL INF64 = ((LL)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;

using pii = pair<int, int>;
using pll = pair<LL, LL>;
using pdd = pair<double, double>;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<LL>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vs = vector<string>;
using vb = vector<bool>;
using vvb = vector<vb>;

vvi puzzle(4, vi(4));
vvi input(4, vi(4));

bool solve(int y, int x) {
	REP(i, 4) {
		const int ny = y + dy[i];
		const int nx = x + dx[i];

		if (ny < 0 || 3 < ny || nx < 0 || 3 < nx) continue;
		if (puzzle[ny][nx] != input[y][x]) continue;

		swap(puzzle[ny][nx], puzzle[y][x]);
		solve(ny, nx);
	}

	REP(i, 4) {
		REP(j, 4) {
			if (input[i][j] != puzzle[i][j]) return false;
		}
	}

	return true;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int cnt = 1;
	REP(i, 4) {
		REP(j, 4) {
			puzzle[i][j] = (cnt != 16 ? cnt : 0);
			cnt++;
		}
	}

	REP(i, 4) REP(j, 4) cin >> input[i][j];
	cout << (solve(3, 3) ? "Yes" : "No") << endl;
	return 0;
}