#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
using ll = long long;

struct pos {
    int x, y;
    pos operator+(pos &rhs) const {
        return {x + rhs.x, y + rhs.y};
    }
    pos &operator+=(const pos &rhs) {
        x += rhs.x, y += rhs.y;
        return *this;
    }
    bool operator==(pos &rhs) const {
        return x == rhs.x && y == rhs.y;
    }
};

const vector<pos> moves{{1,  0},
                        {-1, 0},
                        {0,  1},
                        {0,  -1}};

const int w = 4, h = 4;

bool inRange(pos p) {
    return 0 <= p.x && p.x < h && 0 <= p.y && p.y < w;
}

int main() {
    vector<vector<int>> ban(4, vector<int>(4));

    pos emp;
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
            cin >> ban[i][j];
            if (ban[i][j] == 0) {
                emp = {i, j};
                continue;
            }
        }
    }

    queue<pos> que;
    que.push(emp);
    while (!que.empty()) {
        pos here = que.front();
        que.pop();

        for (auto move:moves) {
            pos next = here + move;
            if (inRange(next) && ban[next.x][next.y] == here.x * 4 + here.y + 1) {
                ban[here.x][here.y] = ban[next.x][next.y], ban[next.x][next.y] = 0;
                que.push(next);
            }
        }
    }

    bool ret = true;
    for (int i = 0; i < 4; i++) {
        for (int j = 0; j < 4; j++) {
            if (ban[i][j] != (i * 4 + j + 1) % 16)ret = false;
        }
    }

    cout << (ret ? "Yes" : "No") << endl;
    return 0;
}