import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


A = [list(map(int, input().split())) for _ in range(4)]
for i in range(4):
    for j in range(4):
        if A[i][j] == 0:
            blank = (i, j)


def dfs(B, blank, moved):
    flag = True
    for i in range(4):
        for j in range(4):
            if A[i][j] != B[i][j]:
                flag = False
                break
    if flag is True:
        print('Yes')
        exit()

    bx, by = blank
    darr = [(1, 0), (0, 1), (-1, 0), (0, -1)]
    for dx, dy in darr:
        nx, ny = bx + dx, by + dy
        if nx < 0 or nx > 3 or ny < 0 or ny > 3:
            continue
        if B[nx][ny] in moved:
            continue
        moved.add(B[nx][ny])
        B[bx][by], B[nx][ny] = B[nx][ny], B[bx][by]
        dfs(B, (nx, ny), moved)
        B[bx][by], B[nx][ny] = B[nx][ny], B[bx][by]
        moved.remove(B[nx][ny])


B = [[4 * i + j + 1 for j in range(4)] for i in range(4)]
B[-1][-1] = 0
dfs(B, (3, 3), set())
print('No')