#include <string> #include <vector> #include<iostream> #include<cstdio> #include<cstdlib> #include<stack> #include<queue> #include<cmath> #include<algorithm> #include<functional> #include<list> #include<deque> #include<bitset> #include<set> #include<map> #include<unordered_map> #include<cstring> #include<sstream> #include<complex> #include<iomanip> #include<numeric> #define X first #define Y seconde #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X)) #define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; template<class T> using vv=vector<vector<T>>; template<class T> ostream& operator<<(ostream &os, const vector<T> &t) { os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;} template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";} int dx[]={1,0,-1,0},dy[]={0,1,0,-1}; int main(){ ios_base::sync_with_stdio(false); cout<<fixed<<setprecision(0); vv<int> a(4,vector<int>(4)),ok(4,vector<int>(4)); rep(i,4)rep(j,4)ok[i][j]=(i*4+j+1)%16; rep(i,4)rep(j,4)cin>>a[i][j]; rep(aaa,20){ //cout<<a; if(a==ok)break; int x,y; rep(i,4)rep(j,4) if(a[i][j]==0){x=j; y=i;} int f=0; rep(i,4){ int X=x+dx[i],Y=y+dy[i]; if(X<0 || 4<=X || Y<0 || 4<=Y) continue; if(a[Y][X]==ok[y][x]){ swap(a[Y][X],a[y][x]); f=1; break; } } if(!f){ cout<<"No"<<endl; return 0; } } cout<<(a==ok?"Yes":"No")<<endl; return 0; }