/* Generated by powerful Codeforces Tool
 * You can download the binary file in here https://github.com/xalanq/cf-tool (win, osx, linux)
 * Author: step_by_step
 * Time: 2020-03-19 17:35:03
**/

//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
  
#include <iostream>
#include <stdlib.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <assert.h>
#include <memory.h>
#include <time.h>
#include <bitset>

#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define ld long double
#define rep(i, l, r) for (int i = (l); i < (r); i++)
#define repb(i, r, l) for (int i = (r); i > (l); i--)
#define sz(a) (int)a.size()
#define fi first
#define se second
#define mp(a, b) make_pair(a, b)
#define rank qwertyuio
#define next dfghjk
#define prev fhsgfhjf
#define plus fsghsf
#define minus ytryr
  
using namespace std;
  
inline bool setmin(int &x, int y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(int &x, int y) { return (y > x) ? x = y, 1 : 0; }
inline bool setmin(ll &x, ll y) { return (y < x) ? x = y, 1 : 0; }
inline bool setmax(ll &x, ll y) { return (y > x) ? x = y, 1 : 0; }
  
const int N = 500;
const int inf = (int)1e9 + 1;
const ll big = (ll)1e18 + 1;
const int P = 239;
const int P1 = 31;
const int P2 = 57;
const int MOD = (int)1e9 + 7;
const int MOD1 = (int)1e9 + 9;
const int MOD2 = 998244353;
const ld eps = 1e-9;
const double pi = atan2(0, -1);
const int ABC = 26;

int leave[N][N];
int d[N][N];

vector<int> dx = {0, 0, -1, 1};
vector<int> dy = {-1, 1, 0, 0};

int main()
{
    //freopen("circus.in", "r", stdin);
    //freopen("circus.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.precision(20);
    cout << fixed;
    //ll TL = 10.95 * CLOCKS_PER_SEC;
    //clock_t time = clock();
    int n;
    cin >> n;
    int perm[n * n];
    rep(i, 0, n * n) {
        cin >> perm[i];
        perm[i]--;
        leave[perm[i] / n][perm[i] % n] = i;
    }
    rep(i, 0, n) {
        rep(j, 0, n) {
            d[i][j] = min(min(i, j), min(n - i - 1, n - j - 1));
        }
    }
    queue<int> q;
    int ans = 0;
    rep(t, 0, n * n) {
        int x = perm[t] / n, y = perm[t] % n;
        ans += d[x][y];
        rep(i, 0, 4) {
            if (x + dx[i] >= 0 && x + dx[i] < n && y + dy[i] >= 0 && y + dy[i] < n) {
                if (d[x + dx[i]][y + dy[i]] > d[x][y]) {
                    d[x + dx[i]][y + dy[i]] = d[x][y];
                    q.push((x + dx[i]) * n + (y + dy[i]));
                }
            }
        }
        while (!q.empty()) {
            x = q.front() / n; y = q.front() % n;
            int v = x * n + y;
            q.pop();
            rep(i, 0, 4) {
            if (x + dx[i] >= 0 && x + dx[i] < n && y + dy[i] >= 0 && y + dy[i] < n) {
                    int v1 = (x + dx[i]) * n + (y + dy[i]);
                    int delta = 0;
                    if (leave[x][y] > t) {
                        delta = 1;
                    }
                    if (d[x + dx[i]][y + dy[i]] > d[x][y] + delta) {
                        d[x + dx[i]][y + dy[i]] = d[x][y] + delta;
                        q.push((x + dx[i]) * n + (y + dy[i]));
                    }
                }
            }
        }
        /*rep(i, 0, n) {
            rep(j, 0, n) {
                cout << d[i][j] << " ";
            }
            cout << "\n";
        }
        cout << "\n";*/
    }
    cout << ans << "\n";
    return 0;
}



Measured memory_bytes: 6580