#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
int n;
int a[2000][2000];
int b[2000], c[2000];
int d[2000][2];
signed main() {
    cin >> n;
    rep(i, n) rep(j, n) {
        a[i][j] = read() - 1;
        b[a[i][j]] += i + j - min(i, j);
        if (j - i < 0) d[a[i][j]][1]++;
    }
    rep(i, n) c[i] = b[i];//(0,0)で全て発射するときのコスト
    rep(i, n) {
        //(i+1,0)から発射する
        for (int j = 0; i - j >= 0; j++) {
            d[a[i - j][j]][0]++;
        }
        rep(j, n) {
            b[j] += d[j][0] - d[j][1];
            chmin(c[j], b[j]);
        }
        for (int j = 0; i + j + 1 < n; j++) {
            d[a[i + j + 1][j]][1]--;
        }
    }
    int ans = 0;
    rep(i, n) ans += c[i];
    cout << ans << endl;
}