#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; } inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; } template inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); } template inline T sqr(T x) { return x*x; } typedef pair P; typedef tuple T; typedef long long ll; typedef unsigned long long ull; #define For(i,a,b) for(ll (i) = (a);i < (b);(i)++) #define rep(i,n) For(i,0,n) #define clr(a) memset((a), 0 ,sizeof(a)) #define mclr(a) memset((a), -1 ,sizeof(a)) #define all(a) (a).begin(),(a).end() #define sz(a) (sizeof(a)) #define Fill(a,v) fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v) const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 }; const int mod = 1000000007; const int INF = 1e9; int a[4][4]; bool f[20]; int target[4][4]; bool dfs(int y,int x){ bool ef = true; rep(i, 4)rep(j, 4){ if (target[i][j] != a[i][j]){ ef = false; break; } } if (ef)return true; bool ret = false; rep(i, 4){ int ty = y + dy[i], tx = x + dx[i]; if (cheak(ty, tx, 4, 4) && !f[a[ty][tx]] && target[y][x] == a[ty][tx]){ a[y][x] = a[ty][tx]; a[ty][tx] = 0; f[a[ty][tx]] = true; if (dfs(ty, tx))return true; f[a[ty][tx]] = false; a[ty][tx] = a[y][x]; a[y][x] = 0; } } return ret; } int main() { int sy, sx; int t = 1; rep(y, 4)rep(x, 4){ cin >> a[y][x]; if (a[y][x] == 0){ sy = y; sx = x; } if (y == 3 && x == 3){ target[y][x] = 0; }else target[y][x] = t++; } f[0] = true; if (dfs(sy, sx)){ cout << "Yes" << endl; } else{ cout << "No" << endl; } return 0; }