// #define LOCAL
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include<bits/stdc++.h>
using namespace std;
#define rep(i,x) for(ll i = 0; i < (ll)(x); i++)
#define rrep(i,x) for(ll i = (ll)(x)-1;0 <= i; i--)
#define reps(i,x) for(ll i = 1; i < (ll)(x)+1; i++)
#define rreps(i,x) for(ll i = (ll)(x); 1 <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> Pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
constexpr ll INF = numeric_limits<ll>::max()/4;
constexpr ll n_max = 2e5+10;
#define int ll

template <typename A, typename B>
string to_string(pair<A, B> p);
string to_string(const string s) {return '"' + s + '"';}
string to_string(const char* c) {return to_string((string) c);}
string to_string(bool b) {return (b ? "true" : "false");}
template <size_t N>
string to_string(bitset<N> v){
    string res = "";
    for(size_t i = 0; i < N; i++) res += static_cast<char>('0' + v[i]);
    return res;
}
template <typename A>
string to_string(A v) {
    bool first = true;
    string res = "{";
    for(const auto &x : v) {
        if(!first) res += ", ";
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p){return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}

void debug_out() {cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<class T>
bool chmax(T &a, T b){if(a < b){a = b; return true;} return false;}
template<class T>
bool chmin(T &a, T b){if(a > b){a = b; return true;} return false;}


signed main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n; cin >> n;
    ll N = n * n;
    vector<ll> a(N);
    rep(i,N) {
        cin >> a[i];
        a[i]--;
    }
    vector<vector<ll>> grid(n, vector<ll>(n, INF)), used(n, vector<ll>(n, 0));
    rep(i,n)rep(j,n){
        grid[i][j] = min({i, j, (n - i - 1), (n - 1 - j)});
    }
    debug(grid);
    
    ll dx[] = {0,0,1,-1};
    ll dy[] = {1,-1,0,0};
    auto is_out = [&](ll x, ll y){
       if(x < 0 || x >= n || y < 0 || y >= n)return true;
       return false;
    };

    queue<Pll> que;
    ll ans = 0;
    rep(i,N){
        ll x = a[i] / n;
        ll y = a[i] % n;
        ans += grid[x][y];
        used[x][y] = 1;
        que.emplace(x, y);
        while(!que.empty()){
            auto [x, y] = que.front();que.pop();
            rep(k,4){
                ll nx = x + dx[k], ny = y + dy[k];
                if(is_out(nx, ny))continue;
                if(used[x][y]){
                    if(chmin(grid[nx][ny], grid[x][y])){
                        que.emplace(nx, ny);
                    }
                }
                else {
                    if(chmin(grid[nx][ny], grid[x][y] + 1)){
                        que.emplace(nx, ny);
                    }
                }
            }
        }

        debug(a[i], x, y, ans);
        debug(grid);
        debug("\n");
    }

    cout << ans << endl;
}

Measured memory_bytes: 9240