//#define _GLIBCXX_DEBUG

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

#define endl '\n'
#define lfs cout<<fixed<<setprecision(10)
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9+7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T1, typename T2>
bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}
template<typename T1, typename T2>
bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,-1,0,0,1,1,-1,-1};
vector<ll>dy={0,0,1,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2>&p){
  return os << p.first << " " << p.second;
}
//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
struct z{
  ll x,y,d;
  z(ll a,ll b,ll c):x(a),y(b),d(c){};
};
int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res=0,buf=0;
  bool judge = true;
  ll n;cin>>n;
  auto d=vec(n,n,0LL);
  rep(i,0,n)rep(j,0,n){
    d[i][j]=min({n-i-1,n-j-1,i,j})+1;
  }
  vector<ll>p(n*n);
  auto valid=[&](ll x,ll y){
    return x>=0&&y>=0&&x<n&&y<n;
  };
  rep(i,0,n*n)cin>>p[i],p[i]--;
  auto t=vec(n,n,true);
  rep(i,0,n*n){
    ll sx=p[i]/n,sy=p[i]%n;
    res+=d[sx][sy]-1;
    deque<z>que;
    ll mi=INF;
    t[sx][sy]=false;
    rep(j,0,4){
      ll x=sx+dx[j],y=sy+dy[j];
      if(!valid(x,y))mi=0;
      else chmin(mi,d[x][y]);
    }
    que.emplace_front(sx,sy,mi);
    while(!que.empty()){
      auto pos = que.front();
      que.pop_front();
      if(d[pos.x][pos.y]<=pos.d)continue;
      d[pos.x][pos.y]=pos.d;
      for(ll j=0;j<4;j++){
        ll x=pos.x+dx[j],y=pos.y+dy[j];
        if(!valid(x,y))continue;
        if(t[x][y])que.emplace_back(x,y,pos.d+1);
        else que.emplace_front(x,y,pos.d);
      }
    }
    /*if(p[i]==8){
      cout<<mi<<endl;
      debug(d,n,n);
      debug(t,n,n);
    }*/
  }
  cout<<res<<endl;
  return 0;
}

Measured memory_bytes: 22060