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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

typedef pair<double, double> pd;
typedef vector<pd> vpd;


#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> t chmax(t&a,u b){if(a<b)a=b; return a;};
template<class t, class u> t chmin(t&a,u b){if(a>b)a=b; return a;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll N;
  IN(N);
  vpll P(N*N);
  REP(i,N*N){
    ll p;
    IN(p);
    p--;
    P[i].first = p/N;
    P[i].second = p%N;
  }

  vvll Cost(N, vll(N, 0));
  REP(i,N) REP(j,N){
    Cost[i][j] = min(min(i, N-1-i), min(j, N-1-j));
  }

  vvll exists(N, vll(N, 1));

  ll ans = 0;
  REP(i,N*N){
    ll x = P[i].first;
    ll y = P[i].second;
    ans += Cost[x][y];
    exists[x][y] = 0;

    queue<pair<ll, ll>> que;
    que.push(make_pair(x-1, y));
    que.push(make_pair(x+1, y));
    que.push(make_pair(x, y-1));
    que.push(make_pair(x, y+1));

    while(que.size()){
      auto pos_tmp = que.front(); que.pop();
      ll x_tmp = pos_tmp.first;
      ll y_tmp = pos_tmp.second;
      if(x_tmp<=0 || x_tmp>=N-1 || y_tmp<=0 || y_tmp>=N-1) continue;
      ll New_Cost = INFLL;
      chmin(New_Cost, Cost[x_tmp-1][y_tmp] + exists[x_tmp-1][y_tmp]);
      chmin(New_Cost, Cost[x_tmp+1][y_tmp] + exists[x_tmp+1][y_tmp]);
      chmin(New_Cost, Cost[x_tmp][y_tmp-1] + exists[x_tmp][y_tmp-1]);
      chmin(New_Cost, Cost[x_tmp][y_tmp+1] + exists[x_tmp][y_tmp+1]);
      if(New_Cost>=Cost[x_tmp][y_tmp]) continue;

      Cost[x_tmp][y_tmp] = New_Cost;

      que.push(make_pair(x_tmp-1, y_tmp));
      que.push(make_pair(x_tmp+1, y_tmp));
      que.push(make_pair(x_tmp, y_tmp-1));
      que.push(make_pair(x_tmp, y_tmp+1));
    }
  }

  OUT(ans);

  return 0;
}


Measured memory_bytes: 11088