#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

// こんなの作るから考察が迷走したんだよな，カス
inline int dis(int ai,int aj,int bi,int bj){
    int d=min(abs(bi-ai),abs(bj-aj));
    if(bi!=ai) ai+=((bi-ai)/abs(bi-ai))*d;
    if(bj!=aj) aj+=((bj-aj)/abs(bj-aj))*d;
    return d+abs(ai-bi)+abs(aj-bj);
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int n;cin>>n;
    int a[n][n];
    vector<vector<pair<int,int>>> v(n);
    rep(i,n){
        rep(j,n){
            cin>>a[i][j];a[i][j]--;
            v[a[i][j]].push_back(make_pair(i,j));
        }
    }
    int ans=0;
    rep(i,n){
        vector<int> res(n,0),imou(n,0),imod(n,0);
        int cost=0;
        for(auto &p:v[i]){
            cost+=p.second;

            int u=p.first-p.second-1;
            if(u>=0) imou[u]++;
            int d=p.first+p.second+1;
            if(d<n)  imod[d]++;
        }
        
        {
            int cnt=0,sum=0;
            rep(i,n){
                cnt+=imod[i];
                sum+=cnt;
                res[i]+=sum;
            }
        }
        {
            int cnt=0,sum=0;
            for(int i=n-1;i>=0;i--){
                cnt+=imou[i];
                sum+=cnt;
                res[i]+=sum;
            }
        }
        // debug(imod);debug(imou);
        // debug(res);
        // cout<<cost+*min_element(ALL(res))<<endl;
        ans+=cost+*min_element(ALL(res));
    }
    cout<<ans<<endl;
    return 0;
}