import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write

A=[list(map(int,readline().split())) for i in range(4)]
B=[[(i*4+j+1)%16 for j in range(4)] for i in range(4)]
x,y=3,3
while A[x][y]:
    for dx,dy in ((0,1),(1,0),(0,-1),(-1,0)):
        if 0<=x+dx<4 and 0<=y+dy<4 and B[x+dx][y+dy]==A[x][y]:
            B[x][y],B[x+dx][y+dy]=B[x+dx][y+dy],B[x][y]
            x+=dx
            y+=dy
            break
    else:
        break
if A==B:
    print("Yes")
else:
    print("No")