#include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>
#include <queue>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
	#define DEBUG_OUTPUT_ENABLED 1
	#define DBG(X) dout << #X << "=" << (X) << '\n';
	#define SAY(X) dout << (X) << '\n';
#else
	#define DEBUG_OUTPUT_ENABLED 0
	#define DBG(X) 42;
	#define SAY(X) 42;
#endif

#define dout   ___debug::instance

using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const set<T>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S>& v) { for(auto el: v) cout << el << " "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const multiset<T>& v) { for(auto el: v) cout << el << " "; return os; }
namespace ___debug {
	struct DebugStream {
		private:
			bool is_first;
		public:
			DebugStream(bool _is_first): is_first(_is_first) {}
			template<typename T> DebugStream operator<<(const T& value) const {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				cout << value;
				return DebugStream(false);
			};

			template<typename T> DebugStream printArray(T* l, T* r) {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				while(l != r) {
					cout << (*l);
					++l;
					if(l == r) {
						cout << '\n';
					} else {
						cout << ' ';
					}
				}
				return DebugStream(false);
			}
	};
	DebugStream instance(true);
};

const int INT_INF = (int)(2e9);
const ll  LL_INF  = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for(auto& elem: ret) cin >> elem; return ret; }
template<typename T> inline void makeUnique(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
const int MAXN = 577;
int P[MAXN * MAXN], n;
int dp[MAXN][MAXN], dead[MAXN][MAXN];
pii Q[MAXN * MAXN * 2];
int head;
void upd(int i, int j, int x) {
	if(x < dp[i][j]) {
		dp[i][j] = x;
		Q[head++] = make_pair(i, j);
	}
}
void solve() {
	cin >> n;
	for(int i = 0; i < n * n; ++i) {
		P[i] = fetch<int>() - 1;
	}
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < n; ++j) {
			dp[i][j] = INT_INF;
			dp[i][j] = min(dp[i][j], i + 1);
			dp[i][j] = min(dp[i][j], j + 1);
			dp[i][j] = min(dp[i][j], n - i);
			dp[i][j] = min(dp[i][j], n - j);
		}
	}
	ll answ = 0;
	for(int t = 0; t < n * n; ++t) {
		int si = P[t] / n;
		int sj = P[t] % n;
		int x = dp[si][sj] - 1;
		//cout << si + 1 << ' ' << sj + 1 << ' ' << x << '\n';
		dead[si][sj] = 1;
		answ += x;
		head = 0;
		upd(si, sj, x);
		for(int ptr = 0; ptr < head; ++ptr) {
			int i = Q[ptr].first;
			int j = Q[ptr].second;
			int y = dp[i][j];
			if(i) {
				upd(i - 1, j, y + (dead[i - 1][j] ^ 1));
			}
			if(j) {
				upd(i, j - 1, y + (dead[i][j - 1] ^ 1));
			}
			if(i < n - 1) {
				upd(i + 1, j, y + (dead[i + 1][j] ^ 1));
			}
			if(j < n - 1) {
				upd(i, j + 1, y + (dead[i][j + 1] ^ 1));
			}
		}
	}
	cout << answ << '\n';
}

int main() {
	fast_io();
	solve();

	return 0;
}


Measured memory_bytes: 8684