import math
def minimumcost(lis, poss):
    i = 1
    temp = 0
    mincost = []
    while i<len(poss):
        if i%9==0:
            temp+=abs(lis[((i%9)-1)]-poss[i])
            mincost.append(temp)
            temp = 0
            i+=1
        else:
            temp+=abs(lis[((i%9)-1)]-poss[i])
            i+=1
    print min(mincost)


arr = []
for line in range(0,3):
    arr+=list(map(int,raw_input().strip().split()))
posss =[0,4,9,2,3,5,7,8,1,6,4,3,8,9,5,1,2,7,6,2,9,4,7,5,3,6,1,8,6,7,2,1,5,9,8,3,4,6,1,8,7,5,3,2,9,4,8,3,4,1,5,9,6,7,2,8,1,6,3,5,7,4,9,2,2,7,6,9,5,1,4,3,8]
minimumcost(arr,posss)