def dfs(hx, hy):
	for i in range(4):
		nx, ny = hx + dx[i], hy + dy[i]
		hn = hy*4+hx
		if 0 <= nx < 4 and 0 <= ny < 4 and P[ny][nx] == hn:
			P[hy][hx] = hn
			dfs(nx,ny)
dx = (1,0,-1,0)
dy = (0,1,0,-1)
P = [map(lambda x: int(x) - 1, raw_input().split(" ")) for i in range(4)]
for i in range(16):
	if P[i/4][i%4] == -1:
		s = (i%4,i/4)
		break
dfs(*s)
for i in range(15):
	if P[i/4][i%4] != i:
		print "No"
		break
else:
	print "Yes"