#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll = long long ;
using P = pair<int,int> ;
const int INF = 1e9;
const int MOD = 1000000007;

int main(){
    int n;
    cin >> n;
    vector<vector<int>> maze(n,vector<int>(n,0));
    rep(i,n)rep(j,n) cin >> maze[i][j];
    
    vector<int> cnt(n,0);
    vector<vector<int>> down(n,vector<int>(n,0));
    vector<vector<int>> up(n,vector<int>(n,0));
    rep(i,n)rep(j,n){
        maze[i][j]--;
        int now = maze[i][j];
        cnt[now] += max(i,j);
        down[now][max(i-j,0)] ++;
        up[now][min(i+j,n-1)] ++;
    }
    /*
    rep(i,n)rep(j,n) cout << down[i][j] << " ";
    rep(i,n)rep(j,n) cout << up[i][j] << " ";
    rep(i,n) cout << cnt[i] <<" " ;
    */
    ll ans = 0;
    rep(i,n){
        ll res = cnt[i];
        ll now = cnt[i];
        int cnt_down = n,cnt_up = 0,cnt_pararell = 0;
        rep(j,n-1){
            cnt_down -= down[i][j];
            cnt_pararell += down[i][j];
            cnt_pararell -= up[i][j];
            cnt_up += up[i][j];
            now += cnt_up - cnt_down;
            res = min(res,now);
        }
        //cout <<res << endl;
        ans += res;
    }
    cout << ans << endl;
    return 0;
}