#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template inline string toString(T x) {ostringstream sout;sout< VI; typedef vector VVI; typedef vector VS; typedef pair PII; typedef long long LL; typedef unsigned long long ULL; #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(auto i: c) #define SORT(c) sort((c).begin(),(c).end()) const double EPS = 1e-10; const double PI = acos(-1.0); #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main() { cin.tie(0); ios::sync_with_stdio(false); VVI A(4, VI(4)), B(4, VI(4)); REP(i, 4) REP(j, 4){ cin >> A[i][j]; B[i][j] = i * 4 + j + 1; } B[3][3] = 0; int dx[4] = {-1, 0, 1, 0}; int dy[4] = {0, -1, 0, 1}; int cX = 3, cY = 3, nX, nY; while(nX != cX && nY != cY){ REP(i, 4){ nX = cX + dx[i], nY = cY + dy[i]; if(nX < 0 || nX >= 4 || nY < 0 || nY >= 4) continue; if(A[cX][cY] == B[nX][nY]){ swap(B[cX][cY], B[nX][nY]); cX = nX; cY = nY; break; } } } bool ret = true; REP(i, 4) REP(j, 4){ if(A[i][j] != B[i][j]){ ret = false; break; } if(ret == false) break; } if(ret) cout << "Yes" << endl; else cout << "No" << endl; return 0; }