import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


immutable N = 4;
int[][] A;

void main() {
  try {
    for (; ; ) {
      A = new int[][](N, N);
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        A[x][y] = readInt();
      }
      
      auto perm = new int[N * N];
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        perm[(x * N + y + 1) % (N * N)] = A[x][y];
      }
      debug {
        writefln("perm = %s", perm);
      }
      
      auto vis = new bool[N * N];
      bool ans = true;
      foreach (u; 0 .. N * N) {
        if (!vis[u]) {
          int[] vs;
          for (int v = u; !vis[v]; v = perm[v]) {
            vs ~= v;
            vis[v] = true;
          }
          debug {
            writeln(u, " ", vs);
          }
          if (u == 0) {
            foreach (j; 1 .. vs.length) {
              const x0 = (vs[j] + N * N - 1) / N % N;
              const y0 = (vs[j] + N * N - 1) % N;
              const x1 = (vs[j - 1] + N * N - 1) / N % N;
              const y1 = (vs[j - 1] + N * N - 1) % N;
debug{
writeln(x0,y0," ",x1,y1," ",abs(x0 - x1) + abs(y0 - y1) == 1);
}
              ans = ans && (abs(x0 - x1) + abs(y0 - y1) == 1);
            }
          } else {
            ans = ans && (vs.length == 1);
          }
        }
      }
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}