#include <bits/stdc++.h>

using namespace std;

template<typename T> long long inversion_number(const vector<T>& v) {
  function<long long(vector<T>&)> f = [&](vector<T>& v){
    if (v.size() <= 1u) return 0;
    int n = v.size();
    vector<int> a(v.begin(), v.begin() + n / 2);
    vector<int> b(v.begin() + n / 2, v.end());
    int count = f(a) + f(b);
    for (int i = 0, j = 0, k = 0; i < n; ++i) {
      if (k == b.size()) {
        v[i] = a[j++];
      } else if (j == a.size()) {
        v[i] = b[k++];
      } else if (a[j] <= b[k]) {
        v[i] = a[j++];
      } else {
        v[i] = b[k++];
        count += n / 2 - j;
      }
    }
    return count;
  };
  auto vv = v;
  return f(vv);
}

int main() {
  int a[4][4];
  for (auto& i : a) {
    for (int& j : i) cin >> j;
  }
  vector<int> v;
  for (int i = 0; i < 4; ++i) {
    for (int j = 0; j < 4; ++j) {
      int k = a[i][i % 2 ? j : 3 - j];
      if (k) v.emplace_back(k);
    }
  }
  if (inversion_number(v) % 2) {
    cout << "No" << endl;
    return 0;
  }
  for (int i = 0; i < 4; ++i) {
    for (int j = 0; j < 4; ++j) {
      if (a[i][j] == 0) continue;
      int d = a[i][j] - (i * 4 + j + 1);
      if (d != -4 && d != -1 && d != 0 && d != 1 && d != 4) {
        cout << "No" << endl;
        return 0;
      }
    }
  }
  cout << "Yes" << endl;
}