#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<vector<int>> a(4, vector<int>(4));
    auto grid = a;
    int x = 0, y = 0;
    int val = 1;
    for(int i = 0; i < 4; ++i){
        for(int j = 0; j < 4; ++j){
            cin >> a[i][j];
            if(a[i][j] == 0)    x = i, y = j;
            grid[i][j] = val++;
        }
    }
    grid[3][3] = 0;

    bool update = true;
    while(update){
        update = false;
        for(int i = 0; i < 4; ++i){
            int nx = x + dx[i], ny = y + dy[i];
            if(nx < 0 || nx >= 4 || ny < 0 || ny >= 4)  continue;
            if(a[nx][ny] == grid[x][y]){
                swap(a[nx][ny], a[x][y]);
                x = nx; y = ny;
                update = true;
                break;
            }
        }
    }

    for(int i = 0; i < 4; ++i){
        for(int j = 0; j < 4; ++j){
            if(a[i][j] != grid[i][j]){
                cout << "No\n";
                return 0;
            }
        }
    }
    cout << "Yes\n";

    return 0;
}