#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>

using namespace std;
using ll = int_fast64_t;
using ld = long double;
#define int ll
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define R pair<pair<int, int>, pair<int, int>>
#define S(i,j,k,l) mkp(mkp(i,j),mkp(k,l))
#define rep(i,n) for(int (i) = 0 ; (i) < (n) ; (i)++)
#define rng(i,s,n) for(int (i) = (s) ; (i) < (n) ; (i)++)
#define req(n,i) for(int (i) = (n) - 1 ; (i) >= 0 ; (i)--)
#define range(i,v) for(auto& (i) : v)
#define mkp make_pair
#define mem(x,k) memset(x,k,sizeof(x))
#define vec vector
#define pb emplace_back
#define lb lower_bound
#define ub upper_bound
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) lower_bound(all(b),(i))-b.begin()
#define ssp(i,n) (i==n-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define itn int
#define pri_que priority_queue
#define pp(x,y) pb(H{x,y})
#define ppp(x,y,z) pb(Q(x,y,z))
#define pppp(x,y,z,w) pb(S(x,y,z,w))
#define cyes cout<<"Yes\n"
#define cno cout<<"No\n"
//#define endl "\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int MXN = 500000 + 100;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
const vec<int>dx{ -1,1,0,0 }, dy{ 0,0,-1,1 };
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(bool g = 0) { H u; ll k = scanf("%lld %lld", &u.fs, &u.sc); if (g) u.fs--, u.sc--; return u; }
void printh(H t) { printf("%lld %lld\n", t.fs, t.sc); }
bool inarea(H t, int h, int w) { return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll mod_pow(ll x, ll n, ll p = mod) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x % p;
		x = x * x % p;
		n >>= 1;
	}
	return res;
}//x^n%p
ll bitcount(ll x) {
	int sum = 0; for (int i = 0; i < 60; i++)if ((1ll << i) & x) sum++;
	return sum;
}
/*constexpr int fn_ = 1000005;
ll fact_[fn_], comp_[fn_];
ll comb(ll x, ll y, ll Mod = mod) {
	if (!fact_[0]) {
		fact_[0] = 1; comp_[0] = 1;
		for (int i = 1; i < fn_; i++)
			fact_[i] = fact_[i - 1] * i % Mod;
		comp_[fn_ - 1] = mod_pow(fact_[fn_ - 1], Mod - 2, Mod);
		for (int i = fn_ - 2; i > 0; i--)
			comp_[i] = comp_[i + 1] * (i + 1) % Mod;
	}
	if (x < y) return 0;
	return fact_[x] * comp_[x - y] % Mod * comp_[y] % Mod;
}*/
//--------------------------------------------------------------
int n;
int a[2000][2000];
int b[2000];//現在のコスト
int ans[2000];//答えのコスト
int c[2000][2];
mt19937 rnd(114514);
void generate(int t) {
	string k = (t <= 9 ? "0" : "");
	ofstream ifs("input/" + k + to_string(t) + ".txt");
	n = rnd() % 1000 + 1;
	if (t <= 7) n %= 50 + 1;
	if (t == 2) n = 2;
	if (t == 1) n = 1;
	if (t >= 17) n = 1000;
	else if (t >= 15) n = 998;
	priority_queue<H>p;
	rep(i, n)rep(j, n) p.push(H{ rnd(), i });
	rep(i, n)rep(j, n) {
		a[i][j] = p.top().sc;
		p.pop();
	}
	rep(i, n) {
		b[i] = 0; ans[i] = 0;
		c[i][0] = 0; c[i][1] = 0;
	}
	ifs << n << endl;
	rep(i, n)rep(j, n) {
		if (j == n - 1) ifs << a[i][j] + 1 << endl;
		else ifs << a[i][j] + 1 << " ";
	}
}
int solve2() {
	cin >> n;
	rep(i, n)rep(j, n) a[i][j] = read() - 1;
	int ans = 0;
	rep(i, n) {
		int res = inf;
		rep(j, n) {
			int sum = 0;
			//色iの視点をjにする
			rep(x, n)rep(y, n) {
				if (a[x][y] == i) {
					sum += abs(x - j) + y - min(abs(x - j), y);
				}
			}
			res = min(res, sum);
		}
		ans += res;
	}
	return ans;
}
int solve() {
	//cin >> n;
	rep(i, n)rep(j, n) {
		//a[i][j] = read() - 1;
		b[a[i][j]] += i + j - min(i, j);
		if (j < i) c[a[i][j]][1]++;
	}
	rep(i, n) {
		ans[i] = b[i];
	}
	rep(i, n) {
		for (int j = 0; i - j >= 0; j++) {
			c[a[i - j][j]][0]++;
		}
		rep(j, n) {
			b[j] += c[j][0] - c[j][1];
		}
		rep(j, n) chmin(ans[j], b[j]);
		for (int j = 0; i + j + 1 < n; j++) {
			c[a[i + j + 1][j]][1]--;
		}
	}
	int sum = 0;
	rep(i, n) sum += ans[i];
	return sum;
}
signed main() {
	cout << solve2() << endl;
	/*rep(_, 20) {
		generate(_ + 1);
		string k = (_ <= 8 ? "0" : "");
		ofstream ofs("output/" + k + to_string(_ + 1) + ".txt");
		ofs << solve() << endl;
		ofs.close();
		cout << _ << endl;
	}*/
}