from collections import deque

d = deque([1])
cakes = set()
SIZE = 5
C = tuple(tuple(map(int, input().split())) for _ in range(SIZE))
S = sum(sum(x for x in row) for row in C)


def is_connected(v, x, y):
    for dx, dy in ((1, 0), (0, 1), (-1, 0), (0, -1)):
        xdx = x + dx
        ydy = y + dy
        if not (0 <= xdx < SIZE and 0 <= ydy < SIZE):
            continue
        neighbor_idx = ydy * SIZE + xdx
        if (v >> neighbor_idx) & 1:
            return True
    return False


while d:
    v = d.pop()
    cakes.add(v)
    for x in range(SIZE):
        for y in range(SIZE):
            idx = y * SIZE + x
            if (v >> idx) & 1:
                continue
            w = v | (1 << idx)
            if w in cakes:
                continue
            if is_connected(v, x, y):
                d.append(w)

ans = 10 ** 18
for c in cakes:
    tmp = 0
    for x in range(SIZE):
        for y in range(SIZE):
            idx = y * SIZE + x
            if (c >> idx) & 1:
                tmp += C[x][y]
    tmp_ans = abs(tmp - (S - tmp))
    if ans > tmp_ans:
        ans = tmp_ans
print(ans)