#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

int fal[17][17];

int main()
{
	int paz[6][6] = {0};
	for (int i = 0; i <= 5; i++)
		for (int j = 0; j <= 5; j++)
			paz[i][j] = -1;

	for (int i = 1; i <= 4; i++) 
		for (int j = 1; j <= 4; j++) 
			cin >> paz[i][j];
		

	int val = 1;
	for (int i = 1; i <= 4; i++){
		for (int j = 1; j <= 4; j++) {
			if (val == 16)continue;
			if (paz[i][j] != val) {
				if (paz[i + 1][j] == val) {
					if (fal[val + 4][val]) {
						cout << "No" << endl;
						return 0;
					}
					fal[val][val + 4] = 1;
				}
				else if (paz[i - 1][j] == val) {
					if (fal[val - 4][val]) {
						cout << "No" << endl;
						return 0;
					}
					fal[val - 4][val] = 1;
				}
				else if (paz[i][j - 1] == val) {
					if (fal[val - 1][val]) {
						cout << "No" << endl;
						return 0;
					}
					fal[val][val - 1] = 1;
				}
				else if (paz[i][j + 1] == val) {
					if (fal[val + 1][val]) {
						cout << "No" << endl;
						return 0;
					}
					fal[val][val + 1] = 1;
				}
				else {
					cout << "No" << endl;
					return 0;
				}
			}
			val++;
		}
	}
	cout << "Yes" << endl;
	return 0;
}