### BUGGY CODE ###

from sys import stdin
import copy
dx = [1,0,-1,0]
dy = [0,1,0,-1]
dir = "ruld"
N = 4
N2 = 16
LIMIT = 50
MDT = [[0,1,2,3,1,2,3,4,2,3,4,5,3,4,5,6],
        [1,0,1,2,2,1,2,3,3,2,3,4,4,3,4,5],
        [2,1,0,1,3,2,1,2,4,3,2,3,5,4,3,4],
        [3,2,1,0,4,3,2,1,5,4,3,2,6,5,4,3],
        [1,2,3,4,0,1,2,3,1,2,3,4,2,3,4,5],
        [2,1,2,3,1,0,1,2,2,1,2,3,3,2,3,4],
        [3,2,1,2,2,1,0,1,3,2,1,2,4,3,2,3],
        [4,3,2,1,3,2,1,0,4,3,2,1,5,4,3,2],
        [2,3,4,5,1,2,3,4,0,1,2,3,1,2,3,4],
        [3,2,3,4,2,1,2,3,1,0,1,2,2,1,2,3],
        [4,3,2,3,3,2,1,2,2,1,0,1,3,2,1,2],
        [5,4,3,2,4,3,2,1,3,2,1,0,4,3,2,1],
        [3,4,5,6,2,3,4,5,1,2,3,4,0,1,2,3],
        [4,3,4,5,3,2,3,4,2,1,2,3,1,0,1,2],
        [5,4,3,4,4,3,2,3,3,2,1,2,2,1,0,1],
        [6,5,4,3,5,4,3,2,4,3,2,1,3,2,1,0]]
class Puzzle():
    def __init__(self):
        self.f = [0] * N2
        self.space, self.MD = 0, 0
state = Puzzle()
limit = 0
path = [0] * LIMIT
def dfs(depth, prev, limit, state, path):
    if state.MD == 0: return True
    if depth + state.MD > limit: return False
    sx = state.space // N
    sy = state.space % N
    tmp = Puzzle()
    for r in range(4):
        tx = sx + dx[r]
        ty = sy + dy[r]
        if tx < 0 or tx >= N or ty < 0 or ty >= N: continue
        if max(prev, r) - min(prev, r) == 2: continue
        tmp = copy.deepcopy(state)
        state.MD -= MDT[tx * N + ty][state.f[tx * N + ty] - 1]
        state.MD += MDT[sx * N + sy][state.f[tx * N + ty] - 1]
        state.f[tx * N + ty], state.f[sx * N + sy] = state.f[sx * N + sy], state.f[tx * N + ty]
        state.space = tx * N + ty
        if dfs(depth + 1, r, limit, state, path):
            path[depth] = r
            return True
        state = copy.deepcopy(tmp)
    return False
In = Puzzle()
for k in range(N2 // 4):
    for n, j in enumerate(map(int, stdin.readline().split())):
        i = k * 4 + n
        if j == 0:
            In.f[i] = N2
            In.space = i
        else:
            In.f[i] = j
for i in range(0, N2):
    if (In.f[i] == N2): continue
    In.MD += MDT[i][In.f[i] - 1]
ans = ""
for limit in range(In.MD, LIMIT + 1):
    state = copy.deepcopy(In)
    if (dfs(0, -100, limit, state, path)):
        break
print(limit)

### FIXED CODE ###

from heapq import heappop, heappush
manhattan = tuple(tuple(abs((i % 4) - (j % 4)) + abs((i // 4) - (j // 4)) for j in range(16)) for i in range(16))
movables = ((1, 4), (0, 2, 5), (1, 3, 6), (2, 7), (0, 5, 8), (1, 4, 6, 9), (2, 5, 7, 10), (3, 6, 11),
            (4, 9, 12), (5, 8, 10, 13), (6, 9, 11, 14), (7, 10, 15), (8, 13), (9, 12, 14), (10, 13, 15), (11, 14))
swap_mul = tuple(tuple((1 << mf) - (1 << mt) for mt in range(0, 64, 4)) for mf in range(0, 64, 4))
destination = 0xfedcba9876543210
i = 0
board_init = 0
blank_init = 0
for _ in range(4):
    for n in map(int, input().split()):
        if n:
            n -= 1
        else:
            n = 15
            blank_init = i
        board_init += n * 16 ** i
        i += 1
estimation_init = sum(manhattan[i][((board_init >> (4 * i)) & 15)] for i in range(16) if i != blank_init)
queue = [(estimation_init, board_init, blank_init)]
visited = set()
while True:
    estimation, board, blank = heappop(queue)
    if board in visited:
        continue
    elif board == destination:
        print(estimation)
        break
    visited.add(board)
    for new_blank in movables[blank]:
        num = (board >> (4 * new_blank)) & 15
        new_board = board + swap_mul[new_blank][blank] * (15 - num)
        if new_board in visited:
            continue
        new_estimation = estimation + 1 - manhattan[new_blank][num] + manhattan[blank][num]
        if new_estimation > 45:
            continue
        heappush(queue, (new_estimation, new_board, new_blank))