def dfs(start=0,goal=None):
    parents={} # parents=[-1]*N にする場合は if q in parents も変える
    p,t=start,0
    grid,used=tuple(p[0]),tuple(p[1])
    parents[(grid,used)]=-2
    next_set=[(p,t)]
    if grid==goal:
        return t
    while next_set:
        p,t=next_set.pop()
        for q in make_edges(p):
            grid,used=tuple(q[0]),tuple(q[1])
            if (grid,used) in parents:
                continue
            if grid==goal:
                return t+1
            parents[(grid,used)]=tuple(p[0]),tuple(p[1])
            next_set.append((q,t+1))
    return -1


def make_edges(p):
    grid, used=p
    for h0 in range(H):
        for w0 in range(W):
            if grid[h0*W+w0]==0:
                for dh,dw in ((-1,0),(1,0),(0,-1),(0,1)):
                    h,w=h0+dh,w0+dw
                    if h>=H or w>=W or h<0 or w<0:
                        continue
                    if used[h*W+w]==1:
                        continue
                    grid[h0*W+w0],grid[h*W+w] = grid[h*W+w],grid[h0*W+w0]
                    used[h0*W+w0]=1
                    yield grid[:],used[:]
                    used[h0*W+w0]=0
                    grid[h0*W+w0],grid[h*W+w] = grid[h*W+w],grid[h0*W+w0]

H=W=4
start=[]
goal=(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 0)
for _ in range(4):
    start.extend(map(int, input().split()))

res=dfs((start,[0]*16),goal)
print("Yes" if res!=-1 else "No")