from itertools import permutations

def linesum(m, line):
    return sum(m[y][x] for y, x in line)

def complete(m):
    return len(set(linesum(m, i) for i in alld)) == 1

def all_combs():
    for i in permutations(range(1, 10)):
        i = [i[:3], i[3:6], i[6:]]
        if complete(i):
            yield i

def difference(m, a):
    return sum(sum(abs(m[ii][i] - a[ii][i]) for i in range(3)) for ii in range(3))

rows = [[(y, x) for x in range(3)] for y in range(3)]
cols = [[(y, x) for y in range(3)] for x in range(3)]
diagonals = [[(0, 0), (1, 1), (2, 2)], [(0, 2), (1, 1), (2, 0)]]

alld = rows + cols + diagonals

m = [[int(i) for i in input().split()] for i in range(3)]

print(min(difference(m, i) for i in all_combs()))