INF = 10 ** 20
MOD = 10 ** 9 + 7
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  heapq import heappop,heapify,heappush
from bisect import bisect_left
from functools import reduce
from math import gcd

def tot(x,idx):
    ret = 0
    for i in idx:
        ret += max(i[1],abs(i[0] - x))
    return ret

def main():
    n = int(input())
    a = [list(map(int,input().split())) for _ in range(n)]

    idx = [[] for _ in range(n)]
    for i in range(n):
        for j in range(n):
            p = a[i][j] - 1
            idx[p].append((i,j))
    
    ans = 0
    for i in range(n):
        idxs = idx[i]
        l = 0
        r = n
        for _ in range(30):
            mid = (r + l)//2
            if tot(mid - 1,idxs) < tot(mid,idxs):
                r = mid
            else:
                l = mid
        tmp = tot(l,idxs)
        ans += tmp
    
    print(ans)

if __name__ == '__main__':
    main()