#include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b; return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b; return true;
    }
    return false;
}
template<int MOD> struct Fp {
    ll val;
    constexpr Fp(ll v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        ll a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            ll t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, ll n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
constexpr ll MOD = 1e9 + 7;
using mint = Fp<MOD>;

#define pb push_back
#define mp make_pair
#define mt make_tuple

int N;
void debug_print(vector<vector<int>>& cost) {
    REP(h, N) {
        REP(w, N) {
            cout << cost[h][w] << " ";
        }
        cout << endl;
    }
    cout << endl;
}

int dh[] = {0, 0, 1, -1};
int dw[] = {1, -1, 0, 0};


using P = pair<int, int>;


int to_idx(int h, int w) {
    return h * N + w;
}

int main(void)
{
    cin.sync_with_stdio(false);
    cin >> N;

    vector<int> Ps(N * N);
    REP(n, N * N) {
        cin >> Ps[n];
    }
    
    vector<vector<int>> seated(N, vector<int>(N, 1));
    vector<vector<int>> cost(N, vector<int>(N));
    REP(h, N) {
        REP(w, N) {
            int c = w;
            chmin(c, N - w - 1);
            chmin(c, h);
            chmin(c, N - h - 1);
            cost[h][w] = c;
        }
    }
    //debug_print(cost);

    int ans = 0;
    for(auto p: Ps) {
        auto h = (p - 1) / N;
        auto w = (p - 1) % N;
        //cout << "P " << p << ", ->" << h << "," << w << endl;

        auto c = cost[h][w]; 
        ans += c;

        seated[h][w] = 0;


        vector<int> seen(N * N);
        seen[to_idx(h, w)] = 1;

        queue<P> q;
        q.push(mp(h, w));

        while (!q.empty()) {
            auto p = q.front(); q.pop();

            int next_val = c;
            if (seated[p.first][p.second]) {
                next_val++;
            }

            REP(d, 4) {
                auto h2 = p.first + dh[d];
                auto w2 = p.second + dw[d];
                if (h2 < 0 || h2 >= N || w2 < 0 || w2 >= N) continue;

                if (seen[to_idx(h2, w2)]) {
                    continue;
                }

                if (cost[h2][w2] <= next_val) {
                    continue;
                }

                cost[h2][w2] = next_val;
                seen[to_idx(h2, w2)] = next_val;
                q.push(mp(h2, w2));
            }
        }

        //cout << "ans = " << ans << endl;
        //debug_print(cost);
    }
    cout << ans << endl;

    return 0;
}
