#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <stack>
#include <queue>
#include <bitset>
#include <numeric>
#include <cassert>
#include <memory>
#include <random>
#include <functional>
#include <complex>
#include <immintrin.h>
#ifdef DEBUG
#include "./Lib/debug_VC.hpp"
#include "./Lib/Timer.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for(ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for(ll i = (ll)(e-1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x,c) for(const auto& x:(c))
#define REPI2(it,b,e) for(auto it = (b); it != (e); ++it)
#define REPI(it,c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it,c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for(auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(),(x).end()
#define cauto const auto&
/* macro func */
template<class T>
inline auto sort(T& t) { std::sort(ALL(t)); }
template<class T>
inline auto rsort(T& t) { std::sort((t).rbegin(), (t).rend()); }
template<class T>
inline auto unique(T& t) { (t).erase(unique((t).begin(), (t).end()), (t).end()); }
template<class T, class S>
inline auto chmax(T& t, const S& s) { if (s > t) { t = s; return true; } return false; }
template<class T, class S>
inline auto chmin(T& t, const S& s) { if (s < t) { t = s; return true; } return false; }
inline auto BR() { std::cout << "\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template<class T>
using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\n';
using std::cin;
using std::pair;
using std::string;
using std::stack;
using std::queue;
using std::vector;
using std::list;
using std::map;
using std::unordered_map;
using std::multimap;
using std::unordered_multimap;
using std::set;
using std::unordered_set;
using std::unordered_multiset;
using std::multiset;
using std::bitset;
using std::priority_queue;

/* Initial processing  */
struct Preprocessing { Preprocessing() { std::cin.tie(0); std::ios::sync_with_stdio(0); }; }_Preprocessing;

/* Remove the source of the bug */
const signed pow(signed, signed) { assert(false); return -1; }

/* define hash */
namespace std {
template <>	class hash<std::pair<ll, ll>> { public:	size_t operator()(const std::pair<ll, ll>& x) const { return hash<ll>()(1000000000 * x.first + x.second); } };
}

/* input */
template<class T> std::istream& operator >> (std::istream& is, vector<T>& vec) { for (T& x : vec) is >> x; return is; }

/* constant value */
constexpr ll MOD = 1000000007;
//constexpr ll MOD = 998244353;

//=============================================================================================

class UnionFind {
	std::vector<ll> m_root;
	std::vector<ll> m_depth;
	std::vector<ll> m_size;
public:
	UnionFind(ll size_) : m_root(size_), m_depth(size_, 0), m_size(size_, 1) {
		std::iota(m_root.begin(), m_root.end(), 0);
	}
	void unite(ll x, ll y) {
		x = root(x);
		y = root(y);
		if (x == y) return;
		ll t = size(x) + size(y);
		m_size[x] = m_size[y] = t;
		if (m_depth[x] < m_depth[y]) m_root[x] = y;
		else m_root[y] = x;
		if (m_depth[x] == m_depth[y]) ++m_depth[x];
	}
	bool isSame(ll x, ll y) {
		return root(x) == root(y);
	}
	ll root(ll x) {
		if (m_root[x] == x) return x;
		return m_root[x] = root(m_root[x]);
	}
	ll size(ll x) {
		if (m_root[x] == x) return m_size[x];
		return size(m_root[x] = root(m_root[x]));
	}
};

signed main() {
	ll n;
	cin >> n;
	VL p(n * n);
	cin >> p;

	VVL cost(n, VL(n));
	REP(k, (n + 1) / 2)	FOR(i, k, n - k) {
		cost[k][i] = k;
		cost[i][k] = k;
		cost[i][n - k - 1] = k;
		cost[n - k - 1][i] = k;
	}

	V<PAIR> order; order.reserve(n * n);
	VVL table(n, VL(n));
	REP(i, n * n) {
		order.emplace_back((p[i] - 1) / n, (p[i] - 1) % n);
		table[(p[i] - 1) / n][(p[i] - 1) % n] = i;
	}

	auto tree = UnionFind(n * n);
	auto update = [&](ll fy, ll fx, ll val, ll y, ll x) {
		if (y < 0 || x < 0 || y >= n || x >= n) { return; }
		auto r = tree.root(n * y + x);
		auto val2 = cost[r / n][r % n];
		tree.unite(n * fy + fx, n * y + x);
		auto rnew = tree.root(n * y + x);
		chmin(cost[rnew / n][rnew % n], std::min(val, val2));
	};

	ll ans = 0;
	REP(k, n * n) {
		auto [fy, fx] = order[k];

		V<V<bool>> use(n, V<bool>(n, false));
		queue<PAIR> q;
		auto ad = [&](ll y, ll x) {
			if (y < 0 || x < 0 || y >= n || x >= n) { return; }
			if (use[y][x]) { return; }
			q.emplace(PAIR{y, x});
			use[y][x] = true;
		};
		ad(fy, fx);

		ll tmp = 1e10;
		ll high = 0;

		while (!q.empty()) {
			auto [y, x] = q.front();
			q.pop();
			if (table[y][x] > k) {
				auto r = tree.root(y * n + x);
				chmin(tmp, cost[r / n][r % n] + 1);
				continue;
			}
			if (y == 0 || x == 0 || y == n - 1 || x == n - 1) {
				chmin(tmp, 0); break;
			}
			ad(y + 1, x);
			ad(y - 1, x);
			ad(y, x - 1);
			ad(y, x + 1);
		
		}
		ans += tmp;
		update(fy, fx, tmp, fy + 1, fx);
		update(fy, fx, tmp, fy - 1, fx);
		update(fy, fx, tmp, fy, fx + 1);
		update(fy, fx, tmp, fy, fx - 1);

	}
	cout << ans << endl;


	dump(table);
	dump(cost);


}