#include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,K,Q,A,B;
string S;
const ll MOD = 998244353;
//const ll MOD = (1e+9) + 7;
const ll INF = 1LL<<60;
typedef pair<ll, ll> P;

int main() {
    cin>>N;
    mat a(N, vec(N));
    rep(i,N) rep(j,N) {
        cin>>a[i][j];
        --a[i][j];
    }
    mat sumu(N + 2, vec(N, 0)), sumd(N + 2, vec(N, 0));
    rep(i,N){
        rep(j,N){
            ++sumu[min(N + 1, i + 2LL + j)][a[i][j]];
            ++sumd[max(0, i - j)][a[i][j]];
        }
    }
    rep(rp, 2) {
        rep(i, N) rep(j, N) sumu[i + 1][j] += sumu[i][j];
        Rreps(i, N + 1, 1) rep(j, N) sumd[i][j] += sumd[i + 1][j];
    }
    ll ans = N * N * (N - 1) / 2;
    rep(j,N){
        ll temp = INF;
        reps(i,1,N + 1) temp = min(temp, sumu[i][j] + sumd[i][j]);
        ans += temp;
    }
    cout<<ans<<endl;
}