N, = map(int, input().split())
X = []
for _ in range(N):
    X.append(list(map(int, input().split())))
dp = [[0]*N for _ in range(N)]
cc1 = [0]*N
cc2 = [0]*N
for i in range(N):
    xx = X[i]
    for j in range(N):
        dp[0][xx[j]-1] += max(i, j)
        if j < i:
            cc2[xx[j]-1] += 1

for i in range(1, N):
    for j in range(i):
        cc1[X[i-1-j][j]-1] += 1
    for j in range(N):
        dp[i][j] = dp[i-1][j] - cc2[j] + cc1[j]
    for j in range(N-i):
        cc2[X[i+j][j]-1] -= 1

r = 0
for x in zip(*dp):
    r += min(x)
print(r)