global abc abc = -1 global n n = [] def check(z, k): a = sum(z[0]) b = sum(z[1]) c = sum(z[2]) g = z[0][0] + z[1][1] + z[2][2] h = z[0][2] + z[1][1] + z[2][0] d = z[0][0] + z[1][0] + z[2][0] e = z[0][1] + z[1][1] + z[2][1] f = z[0][2] + z[1][2] + z[2][2] m = [a, b, c, d, e, f, g, h] for i in xrange(1, 8): if m[i] != m[i-1]: return #print k # for i in z: # for j in i: # print j, # print # print '----------' + str(k) global abc if abc == -1 or k < abc: abc = k def solve(b, i, j, s, u, y): # if b[0][0] == 4 and b[0][1] == 9 and b[0][2] == 2 and b[1][0] == 3 and b[1][1] == 5: # if b[1][2] == 7 and b[2][0] == 8 and b[2][1] == 1 and b[2][2] == 6: # print 'hi', i, j, s, u # # print 'hi' a = [b[0][:], b[1][:], b[2][:]] if i > 2: check(a, u) return global n if i > 0: if j == 2: if a[i][0] + a[i][1] >= s: return a[i][j] = s - (a[i][0] + a[i][1]) if a[i][j] < 1 or a[i][j] > 9 or y[a[i][j]] == 1: return y[a[i][j]] = 1 solve(a, i+1, 0, s, u + abs(n[i][j] - a[i][j]), y[:]) return if i == 2: if a[0][j] + a[1][j] >= s: return a[i][j] = s - (a[0][j] + a[1][j]) if a[i][j] < 1 or a[i][j] > 9 or y[a[i][j]] == 1: return y[a[i][j]] = 1 solve(a, i, j+1, s, u + abs(n[i][j] - a[i][j]), y[:]) return for h in xrange(1, 10): a[i][j] = h if y[a[i][j]] == 1: continue y[a[i][j]] = 1 if j == 2: solve(a, i+1, 0, sum(a[0]), u + abs(n[i][j] - a[i][j]), y[:]) else: solve(a, i, j+1, sum(a[0]), u + abs(n[i][j] - a[i][j]), y[:]) y[a[i][j]] = 0 for i in xrange(3): n.append(map(int, raw_input().split(' '))) h = [n[0][:], n[1][:], n[2][:]] y = [0 for t in xrange(10)] solve(h, 0, 0, 0, 0, y[:]) print abc