#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#ifdef ONLINE_JUDGE
  #define debug(x)
  #define debug2(x,y)
  #define debug3(x,y,z)
  #define assert(e) if(!(e)){stod("");}
#else
  #define debug(x) std::cerr<<#x<<": "<<x<<"\n"
  #define debug2(x,y) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
  #define debug3(x,y,z) std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"
#endif

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

vi dy = {1, 0, -1,  0};
vi dx = {0, 1,  0, -1};
void solve() {
  int n;
  scan(n);
  vi p(n*n, 0);
  scan(p);
  rep (i, n*n) {
    p.at(i) -= 1;
  }
  vvi dist(n, vi(n, 0));
  rep (i, (n+1) / 2) {
    int min_val = i;
    int max_val = n - i;
    FOR (j, min_val, max_val) {
      dist.at(min_val).at(j) = i;
      dist.at(max_val - 1).at(j) = i;
      dist.at(j).at(min_val) = i;
      dist.at(j).at(max_val - 1) = i;
    }
  }
  vvi seated(n, vi(n, 1));
  int ans = 0;
  deque<int> q;
  rep (i, n*n) {
    int y = p.at(i) / n;
    int x = p.at(i) % n;
    ans += dist.at(y).at(x);
    seated.at(y).at(x) = 0;
    rep (k, 4) {
      int ny = y + dy.at(k);
      int nx = x + dx.at(k);
      if (ny < 0 || n <= ny || nx < 0 || n <= nx) { continue; }
      int new_dist = dist.at(ny).at(nx) + seated.at(ny).at(nx);
      dist.at(y).at(x) = min(dist.at(y).at(x), new_dist);
    }
    q = {y * n + x};
    while (!q.empty()) {
      int u = q.front();
      q.pop_front();
      int uy = u / n;
      int ux = u % n;
      rep (k, 4) {
        int ny = uy + dy.at(k);
        int nx = ux + dx.at(k);
        if (ny < 0 || n <= ny || nx < 0 || n <= nx) { continue; }
        int new_dist = dist.at(uy).at(ux) + seated.at(uy).at(ux);
        if (dist.at(ny).at(nx) <= new_dist) { continue; }
        dist.at(ny).at(nx) = new_dist;
        q.push_back(ny * n + nx);
      }
    }
    //debug2(p.at(i), dist);
  }
  print(ans);
}

int main() {
  solve();
  return 0;
}


Measured memory_bytes: 5784