//Let's join Kaede Takagaki Fan Club !!=
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
template<class T>
void dmp(T a){
	rep(i,a.size()) cout << a[i] << " ";
	cout << endl;
}
template<class T>
bool chmax(T&a, T b){
	if(a < b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
bool chmin(T&a, T b){
	if(a > b){
		a = b;
		return 1;
	}
	return 0;
}
template<class T>
void g(T &a){
	cin >> a;
}
template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const int mod = 1000000007;
template<class T>
void add(T&a,T b){
	a+=b;
	if(a >= mod) a-=mod;
}



int n, a[1005][1005];
vector<P>pos[1005];
int main(){
	scanf("%d", &n);
	repn(i, n) repn(j, n){
		scanf("%d", &a[i][j]);
		pos[a[i][j]].pb(mp(i, j));
	}
	ll ans = 0;
	repn(x,n){
		int dif = -n;
		int cur = 0;
		int mn = INF;
		int g[1005] = {};
		rep(j, pos[x].size()){
			cur += max(pos[x][j].fi-1, pos[x][j].sc-1);
			int c = pos[x][j].fi - (pos[x][j].sc-1);
			int d = pos[x][j].fi + (pos[x][j].sc-1);
			if(c < 1) dif++;
			else g[c]++;
			if(d <= n) g[d]++;
		}
		
		repn(i, n){
			chmin(mn, cur);
			dif += g[i];
			cur += dif;
		}
		ans += mn;
	}
	o(ans);
}