#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <limits>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <iomanip>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N-1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N-1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; }return false; }
template<class T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; }return false; }
struct mll {
	static ll MOD;
	ll val;
	mll(ll v = 0) : val(v % MOD) { if (val < 0) val += MOD; }
	mll operator - () const { return -val; }
	mll operator + (const mll &b) const { return val + b.val; }
	mll operator - (const mll &b) const { return val - b.val; }
	mll operator * (const mll &b) const { return val * b.val; }
	mll operator / (const mll &b) const { return mll(*this) /= b; }
	mll operator + (ll b) const { return *this + mll(b); }
	mll operator - (ll b) const { return *this - mll(b); }
	mll operator * (ll b) const { return *this * mll(b); }
	friend mll operator + (ll a, const mll &b) { return b + a; }
	friend mll operator - (ll a, const mll &b) { return -b + a; }
	friend mll operator * (ll a, const mll &b) { return b * a; }
	mll &operator += (const mll &b) { val = (val + b.val) % MOD; return *this; }
	mll &operator -= (const mll &b) { val = (val + MOD - b.val) % MOD; return *this; }
	mll &operator *= (const mll &b) { val = (val*b.val) % MOD; return *this; }
	mll &operator /= (const mll &b) {
		ll c = b.val, d = MOD, u = 1, v = 0;
		while (d) {
			ll t = c / d;
			c -= t * d; swap(c, d);
			u -= t * v; swap(u, v);
		}
		val = val * u % MOD;
		if (val < 0) val += MOD;
		return *this;
	}
	mll &operator += (ll b) { return *this += mll(b); }
	mll &operator -= (ll b) { return *this -= mll(b); }
	mll &operator *= (ll b) { return *this *= mll(b); }
	mll &operator /= (ll b) { return *this /= mll(b); }
	bool operator == (const mll &b) { return val == b.val; }
	bool operator != (const mll &b) { return val != b.val; }
	bool operator == (ll b) { return *this == mll(b); }
	bool operator != (ll b) { return *this != mll(b); }
	friend bool operator == (ll a, const mll &b) { return mll(a) == b.val; }
	friend bool operator != (ll a, const mll &b) { return mll(a) != b.val; }
	friend ostream &operator << (ostream &os, const mll &a) { return os << a.val; }
	friend istream &operator >> (istream &is, mll &a) { return is >> a.val; }
	static mll Combination(ll a, ll b) {
		chmin(b, a - b);
		if (b < 0) return mll(0);
		mll c = 1;
		rep(i, b) c *= a - i;
		rep(i, b) c /= i + 1;
		return c;
	}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
	Fast() {
		cin.tie(0);
		ios::sync_with_stdio(false);
		cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
	}
} fast; //cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7);// 998244353ll;


//--debug--
#ifdef LOCAL
void _debug_out_(string s = "") {
	if (s != "") { eprintf(s.c_str()); }
	else { eprintf("\n"); }
}
void _debug_out_(ll x, string s = "") {
	if (s != "") { eprintf(s.c_str(), x); }
	else { eprintf("%lld\n", x); }
}
void _debug_out_(vvll x, string s = "") {
	string t = s;
	if (s == "") {
		ll maxLen = 0;
		rep(i, (ll)x.size()) rep(j, (ll)x[i].size()) {
			ll n = x[i][j] / 10, len = 1;
			while (n > 0) { len++; n /= 10; }
			chmax(maxLen, len);
		}
		t = "%" + to_string(maxLen) + "lld ";
	}
	rep(i, (ll)x.size()) { rep(j, (ll)x[i].size()) { eprintf(t.c_str(), x[i][j]); } eprintf("\n"); }
	eprintf("\n");
}
void _debug_out_(vll x, string s = "") {
	rep(i, (ll)x.size()) { if (s != "") { eprintf(s.c_str(), x[i]); } else { eprintf("%lld ", x[i]); } }
	eprintf("\n");
}
void _debug_out_(vector<bool> x) {
	rep(i, (ll)x.size()) { eprintf("%s", x[i] ? "o" : "x"); }
	eprintf("\n");
}
void _debug_out_(vector<string> x) {
	rep(i, (ll)x.size()) { eprintf("%s\n", x[i].c_str()); }
	eprintf("\n");
}
void _debug_out_(vector<vector<bool>> x) {
	rep(i, (ll)x.size()) { rep(j, (ll)x[i].size()) { eprintf("%s", x[i][j] ? "o" : "x"); } eprintf("\n"); }
	eprintf("\n");
}
void _debug_out_(map<ll, ll> x) {
	auto begin = x.begin(), end = x.end();
	for (auto iter = begin; iter != end; iter++) { eprintf("%lld:%lld ", iter->first, iter->second); }
	eprintf("\n");
}
void _debug_out_(map<char, ll> x) {
	auto begin = x.begin(), end = x.end();
	for (auto iter = begin; iter != end; iter++) { eprintf("%c:%lld ", iter->first, iter->second); }
	eprintf("\n");
}
#define debug_out(...) _debug_out_(__VA_ARGS__)
#else
#define debug_out(...) 42
#endif
//--debug--



struct LLPoint {
	ll x = 0;
	ll y = 0;
	ll d = 0;
	LLPoint() {}
	LLPoint(ll x, ll y, ll d) {
		this->x = x;
		this->y = y;
		this->d = d;
	}

};

ll min4(ll x, ll y, ll N) {
	ll result = INF;
	chmin(result, x);
	chmin(result, y);
	chmin(result, N - x - 1);
	chmin(result, N - y - 1);
	return result;
}

int main() {
	ll N;
	cin >> N;
	vector<ll> P(N * N);
	rep(i, N * N) {
		cin >> P[i];
		P[i]--;
	}

	vvll up(N, vll(N, 0));
	vvll down(N, vll(N, 0));
	vvll left(N, vll(N, 0));
	vvll right(N, vll(N, 0));
	rep(y, N) {
		rep(x, N) {
			left[y][x] = x > 0 ? min4(x - 1, y, N) + 1: 0;
			right[y][x] = x < N - 1 ? min4(x + 1, y, N) + 1 : 0;
			up[y][x] = y > 0 ? min4(x, y - 1, N) + 1 : 0;
			down[y][x] = y < N - 1 ? min4(x, y + 1, N) + 1 : 0;
		}
	}
	vvll exist(N, vll(N, 1));

	debug_out("↑\n");
	debug_out(up);
	debug_out("↓\n");
	debug_out(down);
	debug_out("←\n");
	debug_out(left);
	debug_out("→\n");
	debug_out(right);
	debug_out("exist\n");
	debug_out(exist);

	queue<LLPoint> q; //next, どこから来たか
	ll answer = 0;

	rep(z, N * N) {
		ll remove = P[z];
		ll y = remove / N;
		ll x = remove % N;
		exist[y][x] = 0;
		ll result = INF;
		chmin(result, up[y][x]);
		chmin(result, down[y][x]);
		chmin(result, left[y][x]);
		chmin(result, right[y][x]);
		answer += result;

		debug_out("x:");
		debug_out(x);
		debug_out("y:");
		debug_out(y);
		debug_out(" result:");
		debug_out(result);
		debug_out();

		if (x > 0) {
			//←を探索
			if (result < right[y][x - 1]) {
				right[y][x - 1] = result;
				q.push(LLPoint(x - 1, y, 1));
			}
		}
		if (x < N - 1) {
			//→を探索
			if (result < left[y][x + 1]) {
				left[y][x + 1] = result;
				q.push(LLPoint(x + 1, y, 2));
			}
		}
		if (y > 0) {
			//↑を探索
			if (result < down[y - 1][x]) {
				down[y - 1][x] = result;
				q.push(LLPoint(x, y - 1, 4));
			}
		}
		if (y < N - 1) {
			//↓を探索
			if (result < up[y + 1][x]) {
				up[y + 1][x] = result;
				q.push(LLPoint(x, y + 1, 8));
			}
		}

		while (q.empty() == false) {
			auto curr = q.front();
			q.pop();

			//debug_out("x:");
			//debug_out(curr.x);
			//debug_out("y:");
			//debug_out(curr.y);
			//debug_out();

			ll minCost = INF;
			chmin(minCost, up[curr.y][curr.x]);
			chmin(minCost, down[curr.y][curr.x]);
			chmin(minCost, left[curr.y][curr.x]);
			chmin(minCost, right[curr.y][curr.x]);

			minCost += exist[curr.y][curr.x] ? 1 : 0;

			//debug_out("minCost:");
			//debug_out(minCost);
			//debug_out();

			if (curr.x > 0) {
				//←を探索
				if (minCost < right[curr.y][curr.x - 1]) {
					right[curr.y][curr.x - 1] = minCost;
					q.push(LLPoint(curr.x - 1, curr.y, 1));
				}
			}
			if (curr.x < N - 1) {
				//→を探索
				if (minCost < left[curr.y][curr.x + 1]) {
					left[curr.y][curr.x + 1] = minCost;
					q.push(LLPoint(curr.x + 1, curr.y, 2));
				}
			}
			if (curr.y > 0) {
				//↑を探索
				if (minCost < down[curr.y - 1][curr.x]) {
					down[curr.y - 1][curr.x] = minCost;
					q.push(LLPoint(curr.x, curr.y - 1, 4));
				}
			}
			if (curr.y < N - 1) {
				//↓を探索
				if (minCost < up[curr.y + 1][curr.x]) {
					up[curr.y + 1][curr.x] = minCost;
					q.push(LLPoint(curr.x, curr.y + 1, 8));
				}
			}
		}

		debug_out("↑\n");
		debug_out(up);
		debug_out("↓\n");
		debug_out(down);
		debug_out("←\n");
		debug_out(left);
		debug_out("→\n");
		debug_out(right);
		debug_out("exist\n");
		debug_out(exist);
	}

	debug_out("answer:");
	cout << answer << endl;

	return 0;
}


Measured memory_bytes: 15060