/*input
3
1 3 7 9 5 4 8 6 2
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<ll,ll>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=500+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
#define MP make_pair
ll mult(ll a,ll b){
    ll res=0LL;
    while(b){
        if(b&1) res=(res+a)%MOD;
        a=(a+a)%MOD;
        b>>=1;
    }
    return res%MOD;
}
ll mypow(ll a,ll b){
    ll res=1LL;
    while(b){
        if(b&1) res=res*a%MOD;
        a=a*a%MOD;
        b>>=1;
    }
    return res;
}
int ans[maxn][maxn];
bool done[maxn][maxn];
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int n;
bool isin(int x,int y){
    if(x<0 or x>=n or y<0 or y>=n) return false;
    return true;
}
int main(){
    ios::sync_with_stdio(false),cin.tie(0);
    cin>>n;
    REP(i,n){
        REP(j,n){
            ans[i][j]=min(min(i,j),min(n-i-1,n-j-1));
            done[i][j]=1;
        }
    }
    ll tot=0;
    REP(asd,n*n){
        int x;
        cin>>x;
        --x;
        int r=x/n,c=x%n;
        tot+=ans[r][c];
        done[r][c]=0;
       // cout<<r<<' '<<c<<'\n';
        for(int i=c+1;i<n;i++){
            MNTO(ans[r][i],ans[r][i-1]+done[r][i-1]);
        }
        for(int i=c-1;i>=0;i--){
            MNTO(ans[r][i],ans[r][i+1]+done[r][i+1]);
        }
        for(int i=r+1;i<n;i++){
            MNTO(ans[i][c],ans[i-1][c]+done[i-1][c]);
        }
        for(int i=r-1;i>=0;i--){
            MNTO(ans[i][c],ans[i+1][c]+done[i+1][c]);
        }
        //cout<<ans[r][c]<<' ';
    }
    cout<<tot;
}