import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def main():
    def dfs(i=3, j=3, x=16):
        fin[i][j] = True
        if aa[i][j] == 0: return True
        if i > 0 and aa[i][j] == x - 4:
            ni, nj = i - 1, j
            nx = x - 4
        elif j > 0 and aa[i][j] == x - 1:
            ni, nj = i, j - 1
            nx = x - 1
        elif i < 3 and aa[i][j] == x + 4:
            ni, nj = i + 1, j
            nx = x + 4
        elif j < 3 and aa[i][j] == x + 1:
            ni, nj = i, j + 1
            nx = x + 1
        else: return False
        return dfs(ni, nj, nx)

    aa = LLI(4)
    fin = [[False] * 4 for _ in range(4)]
    if not dfs():
        print("No")
        exit()
    #p2D(fin)
    for i in range(4):
        for j in range(4):
            if fin[i][j]:continue
            if aa[i][j]!=i*4+j+1:
                print("No")
                exit()
    print("Yes")

main()