#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define mat(type, c, m, n) vector<vector<type>> c(m, vector<type>(n));for(auto& r:c)for(auto& i:r)cin>>i;
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define each(x,y) for(auto &(x):(y))
#define var(type, ...)type __VA_ARGS__;Scan(__VA_ARGS__);
template<typename T> void Scan(T& t) { cin >> t; }
template<typename First, typename...Rest>void Scan(First& first, Rest&...rest) { cin >> first; Scan(rest...); }
#define vec(type, c, n) vector<type> c(n);for(auto& i:c) cin>>i;
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define pb pop_back
#define fi first
#define se second
#define get(a, i) get<i>(a)
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
#define mini min_element
#define maxi max_element
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
bool solve() {
	vector<vi> a = {{1, 2, 3, 4}, {5, 6, 7, 8}, {9, 10, 11, 12}, {13, 14, 15, 0}};
	pii pi[] = {{3, 3},
			{0, 0}, {0, 1}, {0, 2}, {0, 3},
			{1, 0}, {1, 1}, {1, 2}, {1, 3},
			{2, 0}, {2, 1}, {2, 2}, {2, 3},
			{3, 0}, {3, 1}, {3, 2}};
	map<pii, int> ip;
	rep(i, 0, 16) ip[pi[i]] = i;
	vector<vi> v(4, vi(4));
	map<int, pii> mip;
	map<pii, int> mpi;
	rep(i, 0, 4)
		rep(j, 0, 4){
			cin >> v[i][j];
			mip[v[i][j]] = mp(i, j);
			mpi[mp(i, j)] = v[i][j];
		}
	int z;
	rep(i, 0, 16) {
		z = ip[mip[0]];
		swap(v[mip[0].fi][mip[0].se], v[mip[z].fi][mip[z].se]);
		swap(mip[0], mip[z]);
		if (mip[0] == pi[0])
			break;
	}
	return a == v;
}
int main() {
	print(solve() ? "YES" : "NO");
	return 0;
}