import sys input = sys.stdin.readline N=int(input()) MAP=[list(map(int,input().split())) for i in range(N)] D=[[] for i in range(N+1)] for i in range(N): for j in range(N): D[MAP[i][j]].append((i,j)) def count(place,num): RET=0 for x,y in D[num]: RET+=max(0,abs(place-x)-y)+y return RET ANS=0 for i in range(1,N+1): MIN=0 MAX=N-1 while MAX-MIN>2: mid1=MIN+(MAX-MIN)//3 mid2=MIN+(MAX-MIN)*2//3 #print(MIN,MAX,mid1,mid2) mid1C=count(mid1,i) mid2C=count(mid2,i) if mid1C==mid2C: MIN=mid1 MAX=mid2 break elif mid1C