#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;



signed main(){
	int N;
	cin >> N;
	vector<vector<int>>a(N,vector<int>(N));
	vector<vector<pair<int,int>>>pos(N);
	REP(i,N){
		REP(j,N){
			cin >> a[i][j];
			--a[i][j];
			pos[a[i][j]].emplace_back(i,j);
		}
	}
	int ans = 0;
	REP(i,N){
		vector<int>imos1(N + 1),imos2(N + 1);
		for(auto[x,y]:pos[i]){
			++imos1[min(N,x + y + 1)];
			--imos1[N];
			++imos2[0];
			--imos2[max(0ll,x - y)];
		}
		REP(j,N){
			imos1[j + 1] += imos1[j];
			imos2[j + 1] += imos2[j];
		}
		REP(j,N)imos1[j + 1] += imos1[j];
		RREP(j,N)imos2[j] += imos2[j + 1];
		int mi = INF,idx = -1;
		REP(j,N)if(CHMIN(mi,imos1[j] + imos2[j]))idx = j;
		REP(j,N){
			auto[x,y] = pos[i][j];
			ans += max(abs(idx-x),y);
		}
	}
	out(ans);
}