import sys

def square_diff(M1, M2, n=3):
    result = 0
    for i in range(n):
        for j in range(n):
            result += abs(M1[i][j] - M2[i][j])
    return result

possible_squares = [
    [[2, 9, 4],
     [7, 5, 3],
     [6, 1, 8]],
    
    [[4, 9, 2],
     [3, 5, 7],
     [8, 1, 6]],
    
    [[6, 1, 8],
     [7, 5, 3],
     [2, 9, 4]],
    
    [[8, 1, 6],
     [3, 5, 7],
     [4, 9, 2]],
    
    [[6, 7, 2],
     [1, 5, 9],
     [8, 3, 4]],
    
    [[8, 3, 4],
     [1, 5, 9],
     [6, 7, 2]],
    
    [[4, 3, 8],
     [9, 5, 1],
     [2, 7, 6]],
    
    [[2, 7, 6],
     [9, 5, 1],
     [4, 3, 8]]  
]

rows = sys.stdin.read().strip().split('\n')
M = list(map(lambda row: [int(d) for d in row.split(' ')], rows))

diffs = []
for candidate in possible_squares:
    diffs.append(square_diff(M, candidate))

print(min(diffs))