#include <iostream>
#include <queue>
#include <array>
#include <string>
#include <algorithm>
using namespace std;

const int n=16;
int main()
{
    array<int, n> a, goal, vis;
    for(int i=0;i<n;++i) {
        cin>>a[i];
        goal[i]=(i+1)%n;
    }
    vis={};

    queue<pair<array<int, n>, array<int, n>>> q;
    q.push(make_pair(a, vis));
    string res="No";
    while(!q.empty()) {
        auto p=q.front();
        auto b=p.first;
        auto v=p.second;
        q.pop();
        if (b==goal) {
            res="Yes";
            break;
        }
        int da[]={-1, 1, -4, 4};
        for(int i=0;i<n;++i) {
            if (b[i]==0) continue;
            for(auto d: da) {
                if (0<=i+d and i+d<n and b[i+d]==0 and !v[b[i]-1]) {
                    v[b[i]-1]=1;
                    swap(b[i], b[i+d]);
                    q.push(make_pair(b, v));
                    swap(b[i], b[i+d]);
                    v[b[i]-1]=0;
                }
            }
        }
    }
    cout<<res<<endl;
}