#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef complex<double> C;

int board[4][4];
bool used[16];
int y, x;

bool ok() {
    for (int i = 0; i < 15; i++) {
        if (board[i/4][i%4] != i+1) return false;
    }
    return true;
}

bool dfs(int state) {
    if (ok()) return true;
    for (int i = 0; i < 4; i++) {
        int ny = y+dy[i];
        int nx = x+dx[i];
        if (ny < 0 || ny >= 4 || nx < 0 || nx >= 4) continue;
        int tmp = board[ny][nx];
        if ((state>>tmp)&1) continue;
        int ns = state|(1<<tmp);
        board[y][x] = tmp;
        board[ny][nx] = 0;
        int ty = y, tx = x;
        y = ny; x = nx;
        if (dfs(ns)) return true;
        y = ty; x = tx;
        board[ny][nx] = tmp;
        board[y][x] = 0;
    }
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    for (int i = 0; i < 4; i++) for (int j = 0; j < 4; j++) {
        cin >> board[i][j];
        if (board[i][j] == 0) y = i, x = j;
    }
    if (dfs(0)) cout << "Yes" << endl;
    else cout << "No" << endl;
    return 0;
}