# coding: utf-8
# Your code here!
def kaisa2_of_tousa(a,b,p,q,imos):
    if p > q: return
    imos[p] += b
    if p+1 < n: imos[p+1] += a-b
    y = a*(q-p)+b
    if q+1 < n: imos[q+1] += -y-a
    if q+2 < n: imos[q+2] += y


import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
read = sys.stdin.read

n,*a = [int(i) for i in read().split()]

res = [[0]*n for _ in range(n)]
for i in range(n):
    ai = a[n*i:n*(i+1)]
    for j,aij in enumerate(ai):
        kaisa2_of_tousa(0,j,0,n-1,res[aij-1])
        if i-j > 0:
            kaisa2_of_tousa(-1,i-j,0,i-j,res[aij-1])
        if i+j < n-1:
            kaisa2_of_tousa(1,0,i+j,n-1,res[aij-1])

from itertools import accumulate as acc
ans = [0]*n
for i in range(n):
    #print(list(acc(acc(res[i]))))
    ans[i] = min(acc(acc(res[i])))

print(sum(ans))