/*
    author:  Maksim1744
    created: 23.05.2020 15:30:07
*/

#include <bits/stdc++.h>

using namespace std;

#define ll   long long
#define ld   long double

#define mp   make_pair
#define pb   push_back
#define eb   emplace_back

#define sum(a)     ( accumulate ((a).begin(), (a).end(), 0ll))
#define mine(a)    (*min_element((a).begin(), (a).end()))
#define maxe(a)    (*max_element((a).begin(), (a).end()))
#define mini(a)    ( min_element((a).begin(), (a).end()) - (a).begin())
#define maxi(a)    ( max_element((a).begin(), (a).end()) - (a).begin())
#define lowb(a, x) ( lower_bound((a).begin(), (a).end(), (x)) - (a).begin())
#define uppb(a, x) ( upper_bound((a).begin(), (a).end(), (x)) - (a).begin())

template<typename T>             vector<T>& operator--            (vector<T>& v){for (auto& i : v) --i;            return  v;}
template<typename T>             vector<T>& operator++            (vector<T>& v){for (auto& i : v) ++i;            return  v;}
template<typename T>             istream& operator>>(istream& is,  vector<T>& v){for (auto& i : v) is >> i;        return is;}
template<typename T>             ostream& operator<<(ostream& os,  vector<T>& v){for (auto& i : v) os << i << ' '; return os;}
template<typename T, typename U> istream& operator>>(istream& is, pair<T, U>& p){is >> p.first >> p.second;        return is;}
template<typename T, typename U> ostream& operator<<(ostream& os, pair<T, U>& p){os << p.first << ' ' << p.second; return os;}
template<typename T, typename U> pair<T,U> operator-(pair<T,U> a, pair<T,U> b){return mp(a.first-b.first, a.second-b.second);}
template<typename T, typename U> pair<T,U> operator+(pair<T,U> a, pair<T,U> b){return mp(a.first+b.first, a.second+b.second);}
template<typename T, typename U> void umin(T& a, U b){if (a > b) a = b;}
template<typename T, typename U> void umax(T& a, U b){if (a < b) a = b;}

#ifdef HOME
#define TAG_LENGTH       25
#define LR_LEFT          left
#define LR_RIGHT         right
#define LR_VALUE         value
#define LR_SECOND_VALUE  mn
#include "C:/C++ libs/print.cpp"
#else
#define showl            42;
#define shows            42;
#define show(...)        42;
#define showm(...)       42;
#define showt(...)       42;
#define printTree(...)   42;
#define printGraph(...)  42;
#define printLRTree(...) 42;
#define printMatrix(...) 42;
#define printWGraph(...) 42;
#define debug     if (false)
#endif

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

    int n;
    cin >> n;
    vector<vector<int>> v(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            v[i][j] = i * n + j;
        }
    }
    vector<int> p(n * n);
    cin >> p;
    --p;
    vector<vector<int>> d(n, vector<int>(n));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            d[i][j] = min({i, n - i - 1, j, n - j - 1});
        }
    }
    vector<vector<bool>> gone(n, vector<bool>(n, false));
    auto check = [&](int i, int j) {
        return (i >= 0 && j >= 0 && i < n && j < n);
    };
    int ans = 0;
    vector<pair<int, int>> dir = {
        {-1, 0},
        {1, 0},
        {0, 1},
        {0, -1}
    };
    for (auto x : p) {
        // printMatrix(d);
        // shows;
        int i = x / n;
        int j = x % n;
        int cur = d[i][j];
        for (auto dij : dir) {
            auto di = dij.first;
            auto dj = dij.second;
            if (check(i + di, j + dj))
                cur = min(cur, d[i + di][j + dj] + !gone[i + di][j + dj]);
        }
        gone[i][j] = true;
        d[i][j] = cur;
        ans += cur;
        queue<pair<int, int>> q;
        q.emplace(i, j);
        while (!q.empty()) {
            auto ij = q.front();
            auto i = ij.first;
            auto j = ij.second;
            q.pop();
            for (auto [di, dj] : dir) {
                if (check(i + di, j + dj)) {
                    int can = d[i][j] + !gone[i][j];
                    if (can < d[i + di][j + dj]) {
                        d[i + di][j + dj] = can;
                        q.emplace(i + di, j + dj);
                    }
                }
            }
        }
    }
    cout << ans << '\n';

    return 0;
}


Measured memory_bytes: 6304