#include <numeric>
#include <chrono>
#include <random>
#include <array>
#include <iomanip>
#include <stack>
#include <queue>
#include <random>
#include <unordered_set>
#include <unordered_map>
#include <iostream>
#include <sstream>
#include <vector>
#include <cstdio>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <string>
#include <bitset>
#include <cassert>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <sstream>

using namespace std;

using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)

#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e << " ";} cerr << "\n";}
#define logvp(a) {cerr << #a << " = "; fore(e, a) {cerr << "(" << e.first << ", " << e.second << ") ";} cerr << "\n";}
#define logvv(a) {cerr << #a << " = \n"; fore(r, a) { fore(e, r) {cerr << e << " ";} cerr << "\n";} }
#define logvf(a, field) {cerr << #a"."#field << " = \n"; fore(e, a) { cerr << e.field << " ";} cerr << "\n"; }
#define logvff(a, f1, f2) {cerr << #a".{"#f1 << ", "#f2 << "} = \n"; fore(e, a) { cerr << "(" << e.f1 <<", " << e.f2 << ") ";} cerr << "\n"; }
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) cerr << #a << " = " << "(" << a.first << ", " << a.second << ")" << "\n";
#define cond(pred, stmt) if (pred) { stmt }
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif

using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template<typename T> using vec = vector<T>;

template<typename T, typename Dim>
auto make_vec(T value, Dim dim) { return vector<T>(dim, value); }
template<typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) { return make_vec(make_vec(value, dims...), dim1); }

template<typename T>
bool uax(T& v, const T& newv) { if (v < newv) { v = newv; return true; } else return false; }
template<typename T>
bool uin(T& v, const T& newv) { if (v > newv) { v = newv; return true; } else return false; }

template<typename T>
istream& operator>>(istream& is, vector<T>& c) { for (auto& e : c) is >> e; return is; }
template<typename T, size_t N>
istream& operator>>(istream& is, array<T, N>& c) { for (auto& e : c) is >> e; return is; }

// template<typename ...T>
// istream& read(T&... args) { return (cin >> ... >> args); }

static mt19937 rande(123123);
template<typename T>
T rand_int(T from, T to) { uniform_int_distribution<T> distr(from, to); return distr(rande); }

constexpr i64 M = 998244353;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    while (cin >> n) {
        ivec ps(n * n);
        cin >> ps;

        auto mp = make_vec(0, n, n);
        forn(i, n) forn(j, n) {
            mp[i][j] = i * n + j + 1;
        }

        auto ds = make_vec(i64(1e9), n, n);
        forn(i, n) forn(j, n) {
            uin(ds[i][j], min(i, n - i - 1));
            uin(ds[i][j], min(j, n - j - 1));
        }

        i64 ans = 0;
        fore(p, ps) {
            i64 mnc = 1e9;
            int id = -1;
            p--;
            int pi = p / n;
            int pj = p % n;

            ans += ds[pi][pj];

            iip dir[] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
            deque<llp> q;
            q.emplace_back(pi * n + pj, ds[pi][pj]);
            while (!q.empty()) {
                auto [v, d] = q.front(); q.pop_front();
                int vi = v / n;
                int vj = v % n;
                for (auto [di, dj] : dir) {
                    int ni = vi + di;
                    int nj = vj + dj;

                    if (ni >= 0 && ni < n && nj >= 0 && nj < n) {
                        if (uin(ds[ni][nj], d)) {
                            q.emplace_back(ni * n + nj, d + (mp[ni][nj] != 0));
                        }
                    }
                }
            }

            mp[pi][pj] = 0;
        }

        cout << ans << endl;
    }
}

Measured memory_bytes: 7072