#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, j, parity;
    bool yes = true;
    int a[16];
    rep (i,4) REP(j,1,5) {
        int x;
        cin >> x;
        if (x != 0 && x != i*4+j && x != (i-1)*4+j && x != (i+1)*4+j && x != i*4+j-1 && x != i*4+j+1)
            yes = false;
        if (x == 0) {
            a[i*4+j-1] = 16;
            parity = i+j;
        }
        else 
            a[i*4+j] = x;
    }
    rep (i,16) REP (j,i+1,16) {
        if (a[i] > a[j])
            parity++;
    }
    if (yes && parity % 2 == 0)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    return 0;
}