#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e9+7;

int main()
{
	ll n;
	cin >> n;
	vector<vector<ll>> a(n,vector<ll>(n));
	vector<vector<ll>> b(n+1,vector<ll>(n+1));
	rep(i,n){
	    rep(j,n){
	        cin >> a[i][j];
	        a[i][j]--;
	        b[a[i][j]][max(i-j,0LL)]++;
	        b[a[i][j]][min(n,j+i+1)]--;
	    }
	}
	rep(i,n){
	    rep(j,n){
	        b[i][j+1]=b[i][j+1]+b[i][j];
	    }
	}
	vector<ll> pos(n);
	rep(i,n){
	    ll m=-1;
	    rep(j,n){
	        m=max(b[i][j],m);
	    }
	    //cout << m << endl;
	    rep(j,n){
	        if(b[i][j]==m){
	            pos[i]=j;
	            break;
	        }
	    }
	}
	ll ans=0;
	rep(i,n){
	    //cout << pos[i] << endl;
	}
	rep(i,n){
	    rep(j,n){
	        ll h=abs(pos[a[i][j]]-i);
	        ll w=j;
	        ans+=max(h,w);
	    }
	}
	
	cout << ans << endl;
	return 0;
}