#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

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

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

template<typename T> vector<T> make_vector(size_t sz){
	return vector<T>(sz);
}

template<typename T,typename... Ts> 
auto make_vector(size_t sz, Ts... ts){
	return vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));
}

template<typename T,typename U,typename... V> 
typename enable_if<is_same<T, U>::value!=0>::type 
fill_value(U &u, const V... v){
	u=U(v...);
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_value(U &u, const V... v){
	for(auto &e:u){
		fill_value<T>(e,v...);
	}
}

const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

const pid_t pid = getpid();
// Problem Specific Parameter:

int n;
bool blocked[510][510];
int cost[510][510];

// inline int get_cost(int )

void bfs(int sx, int sy) {
	queue<int> que;
	que.push(sx); que.push(sy);

	while(!que.empty()) {
		const int cx = que.front(); que.pop();
		const int cy = que.front(); que.pop();
		
		int ncost = 1 << 20;
		rep(dir, 4) {
			const int nx = cx + dx[dir];
			const int ny = cy + dy[dir];
			int cur = blocked[cx][cy];

			if(0 <= nx and nx < n and 0 <= ny and ny < n) {
				cur += cost[nx][ny];
			}

			chmin(ncost, cur);
		}

		if(cost[cx][cy] != ncost) {
			cost[cx][cy] = ncost;
			rep(dir, 4) {
				const int nx = cx + dx[dir];
				const int ny = cy + dy[dir];

				if(0 <= nx and nx < n and 0 <= ny and ny < n) {
					que.push(nx);
					que.push(ny);
				}
			}
		}
	}
}

int main(void){
	cin >> n;

	ll ans = 0LL;
	vector<int> p(n * n);
	rep(i, n * n) cin >> p[i], p[i]--;

	rep(i, n) rep(j, n) {
		const int u = i + 1;
		const int d = n - i;
		const int l = j + 1;
		const int r = n - j;
		cost[i][j] = min({u, d, l, r});
		blocked[i][j] = true;
	}



	rep(i, n * n) {
		const int cx = p[i] / n;
		const int cy = p[i] % n;
		ans += cost[cx][cy] - 1;

		blocked[cx][cy] = false;
		bfs(cx, cy);

		// cerr << p[i] + 1 << endl;

		// rep(j, n){
		// 	rep(k, n) cerr << blocked[j][k] << " ";
		// 	cerr << endl;
		// }
		// cerr << "=======" << endl;
		// rep(j, n){
		// 	rep(k, n) cerr << cost[j][k] << " ";
		// 	cerr << endl;
		// }
	}

	cout << ans << endl;

	return 0;
}

Measured memory_bytes: 5512