#include <bits/stdc++.h>
using namespace std;

// 基本テンプレート
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define P(x) cout << (x) << endl
#define p(x) cout << (x)
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#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>n; --i)
#define each(x,y) for(auto &(x):(y))
#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))
#define cauto const auto&
#define UNIQUE(v) v.erase( unique(all(v)), v.end() );
#define len(x) ((int)(x).size())
#define length(a)   (sizeof(a)/sizeof(a[0]))
template<typename T> inline bool inside(T y, T x, T h, T w) { return 0 <= y && y < h && 0 <= x && x < w; };

// デバッグ用
template <class T> inline void print(T t){cout << t << endl;}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
#define dbg(v) for(auto i : v) { cout << i << " "; } cout << endl;

// 型
typedef long long ll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;



// 定数
#define PI acos(-1.0)
//constexpr int EPS = (1e-9);
//constexpr int INF = 100000000;

// 4近傍
constexpr int dx[] = {1, 0, -1, 0};
constexpr int dy[] = {0, 1, 0, -1};


// 8近傍
//constexpr int dy[]={0,0,1,-1,1,1,-1,-1};
//constexpr int dx[]={1,-1,0,0,1,-1,1,-1};

//constexpr int MAX = 1e9;

//ll mod = 1000007;

vector<vi> puzzle(4, vi(4, 0));
vector<vi> block(4, vi(4, 0));
vector<vb> used(4, vb(4, false));
int sr, sc;

inline void f() {
	rep(j, 0, 16) {
		used[sr][sc] = true;
		if (puzzle[sr][sc] == block[sr][sc]) break;
		bool flg = false;
		rep(i, 0, 4) {
			int nr = sr + dy[i];
			int nc = sc + dx[i];
			if (0 <= nr && nr < 4 && 0 <= nc && nc < 4 && !used[nr][nc]) {
				if (puzzle[sr][sc] == block[nr][nc]) {
					swap(block[nr][nc], block[sr][sc]);
					sr = nr, sc = nc;
					flg = true;
					break;
				}
			}
		}
		if (!flg) break;
	}
}

int main() {
//	cout << setprecision(12) << fixed;

	rep(i, 0, 4) rep(j, 0, 4) puzzle[i][j] = i * 4 + j + 1;
	puzzle[3][3] = 0;
	rep(i, 0, 4) rep(j, 0, 4) {
		cin >> block[i][j];
		if(block[i][j] == i * 4 + j + 1) used[i][j] = true;
		if(block[i][j] == 0) { sr = i; sc = j; }
	}

	f();
	P(block == puzzle ? "Yes" : "No");

	return 0;
}