#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 998244353;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b>>1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////


int main() {
	ll N;
	cin >> N;

	vector<ll> P(N * N + 1);
	repn(i, N * N) cin >> P[i];

	vvll memo(N + 1, vll(N + 1, 0));
	repn(i, N)repn(j, N) {
		memo[i][j] = min(i - 1, min(N - i, min(j - 1, N - j)));
	}

	vvll seat(N + 1, vll(N + 1, 1));
	ll ans = 0;
	repn(k, N* N) {
		ll i = (P[k] - 1) / N + 1;
		ll j = (P[k] - 1) % N + 1;

		ans += memo[i][j];
		seat[i][j] = 0;

		queue<pair<ll, ll>> q;
		q.push({ i,j });

		while (!q.empty()) {
			ll x = q.front().first;
			ll y = q.front().second;
			q.pop();

			rep(t, 4) {
				ll z = x;
				ll w = y;

				//cout << x << y << endl;

				if (t < 2) z += -1 + 2 * (t % 2);
				else w += -1 + 2 * (t % 2);

				if (z<1 || z>N || w<1 || w>N) { continue; }

				if (memo[x][y] + seat[x][y] < memo[z][w]) {
					memo[z][w] = memo[x][y] + seat[x][y];
					q.push({ z,w });
				}

				//cout << z << " " << w << endl;

			}
		}
		/*
		cout << k << endl;
		repn(i, N) {
			repn(j, N) cout << memo[i][j] << " ";
			cout << endl;
		}
		cout << endl;
		*/

	}

	cout << ans << endl;
}


Measured memory_bytes: 9004