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

int main() {
    vector<vector<int>> field(4, vector<int>(4));
    for (auto &v: field) for (int &vi: v) cin >> vi;
    int zi, zj;
    for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) {
        if (field[i][j] == 0) zi = i, zj = j;
    }
    int nij[] = {0, 1, 0, -1, 0};
    auto out_field = [&](int i, int j) {
        return i < 0 || i >= 4 || j < 0 || j >= 4;
    };
    auto decent_num = [](int i, int j) { return (i * 4 + j + 1) % 16; };
    bool found = true;
    while (found) {
        found = false;
        int need = decent_num(zi, zj);
        for (int k = 0; k < 4; k++) {
            int ni = zi + nij[k];
            int nj = zj + nij[k + 1];
            if (out_field(ni, nj) || field[ni][nj] != need) continue;
            swap(field[zi][zj], field[ni][nj]);
            zi = ni, zj = nj;
            found = true;
            break;
        }
    }
    for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) {
        if (field[i][j] != decent_num(i, j)) {
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;
    return 0;
}