#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)
#define rrep2(i, a, b) for (int i = (a) - 1; i >= (b); i--)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

bool used[16];
int G[4][4];

int dy[4] = {1, 0, -1, 0};
int dx[4] = {0, 1, 0, -1};

bool dfs(int y, int x) {
    bool ok = true;

    rep (k, 15) {
        int i = k / 4;
        int j = k % 4;

        if (G[i][j] != k + 1) ok = false;
    }

    if (ok) return true;

    bool res = false;

    rep (k, 4) {
        int ny = y + dy[k];
        int nx = x + dx[k];

        if (ny < 0 || ny >= 4 || nx < 0 || nx >= 4) continue;
        if (used[G[ny][nx]]) continue;

        used[G[ny][nx]] = true;
        swap(G[ny][nx], G[y][x]);

        res |= dfs(ny, nx);

        swap(G[ny][nx], G[y][x]);
        used[G[ny][nx]] = false;
    }

    return res;
}

int main() {
    rep (i, 4) rep (j, 4) cin >> G[i][j];    

    int sy, sx;

    rep (i, 4) rep (j, 4) if (G[i][j] == 0) sy = i, sx = j;

    if (dfs(sy, sx)) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}