#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
#define ABS(x) max((x),-(x))
#define PQ(T) priority_queue<T,vector<T>,greater<T>>

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD=1000000007LL;

inline ll ADD(ll x, ll y) { return (x+y) % MOD; }
inline ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
inline ll MUL(ll x, ll y) { return x*y % MOD; }
inline ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
inline ll INV(ll y) { /*assert(y%MOD!=0);*/ return POW(y, MOD-2); }
inline ll DIV(ll x, ll y) { return MUL(x, INV(y)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}

void horizontal(vector<int>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%d%c", v[i], (i==L-1)?'\n':' ');
    }
}
void horizontall(vector<long long>& v) {
    int L = v.size();
    for (int i=0; i<L; ++i) {
        printf("%lld%c", v[i], (i==L-1)?'\n':' ');
    }
}








int N;
vi a;
int dr[4] = { -1, 0, 1, 0 },
    dc[4] = { 0, 1, 0, -1 };

int mp[500][500][4];
int minimum[500][500];
int popu[500][500];

using P = tuple<int,int,int,int>;
deque<P> q;

inline void qpush(int val, int r, int c, int side){
    if (q.empty()){
        q.push_back({val, r, c, side});
    } else {
        int o_v,o_r,o_c,o_s;
        tie(o_v,o_r,o_c,o_s) = q.front();
        if (o_v == val){
            q.emplace_front(val, r, c, side);
        } else {
            q.emplace_back(val, r, c, side);
        }
    }
}

inline void propagate(int r, int c, int newv) {
    rep(side,4){
        int ri = r+dr[side], ci = c+dc[side];
        int contre = (side + 2)%4;
        if (IN(ri,0,N-1) && IN(ci,0,N-1)){
            if (mp[ri][ci][contre] > newv) {
                qpush(newv, ri, ci, contre);
            }
        }
    }
}

ll solve() {
    int L = N*N;
    rep(i,L) a[i]--;

    rep(r,N) rep(c,N) {
        rep(side,4) { mp[r][c][side] = INT_MAX; }
        minimum[r][c] = INT_MAX;
        popu[r][c] = 1;
    }

    rep(i,N){
        qpush(0, 0,   i, 0);
        qpush(0, N-1, i, 2);
        qpush(0, i, 0,   3);
        qpush(0, i, N-1, 1);
    }
    while (!q.empty()){
        int val,r,c,side;
        tie(val,r,c,side) = q.front(); q.pop_front();


        if (val >= mp[r][c][side]) continue;
        mp[r][c][side] = val;

        if (val >= minimum[r][c]) continue;
        minimum[r][c] = val;



        propagate(r,c, minimum[r][c] + popu[r][c]);
    }

    int ans = 0;
    rep(i,L){
        int r=a[i]/N, c=a[i]%N;

        ans += minimum[r][c];


        propagate(r,c, minimum[r][c]);

        while (!q.empty()){
            int val,r,c,side;
            tie(val,r,c,side) = q.front();
            q.pop_front();


            if (val >= mp[r][c][side]) continue;
            mp[r][c][side] = val;

            if (val >= minimum[r][c]) continue;
            minimum[r][c] = val;

            propagate(r, c, minimum[r][c] + popu[r][c]);
        }
        popu[r][c] = 0;
    }
    return ans;
}

int main() {
    scanf("%d%*c", &N);
    loadvec(a, N*N);

    cout << solve() << endl;
    return 0;
}


Measured memory_bytes: 20016