#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <numeric>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;



int solve(int n, vector<int> p);

int main(){
  int n;
  cin >> n;
  vector<int> p(n*n);
  cin >> p;

  // int n = 500;
  // cin >> n;
  // vector<int> p(n*n);
  // iota(begin(p), end(p), 1);
  // shuffle(begin(p), end(p), mt);

  solve(n, p);
  return 0;
}

int solve(int n, vector<int> p){
  int M = n+2;
  vector<int> val(M*M, 0);
  for(int i=0; i<n*n; i++){
    int j = p[i]-1;
    int y = j/n + 1;
    int x = j%n + 1;
    int z = y * M + x;
    val[z] = i+1;
  }

  const int inf = M*M;
  vector<int> dist(M*M, inf);
  for(int i=0; i<M; i++){
    dist[0*M + i] = 0;
    dist[i*M + 0] = 0;
    dist[i*M + M-1] = 0;
    dist[(M-1)*M + i] = 0;
  }
  for(int y=1; y<=n; y++){
    for(int x=1; x<=n; x++){
      int z = y * M + x;
      int dy = min(y, M-1-y);
      int dx = min(x, M-1-x);
      dist[z] = min(dy, dx);
    }
  }

  int dx[] = {0, 0, 1,-1};
  int dy[] = {1,-1, 0, 0};

  long long ans = 0;
  for(auto i: p){
    int y = (i-1) / n + 1;
    int x = (i-1) % n + 1;
    int z = y*M + x;

    int w = dist[z];
    for(int k:range(4)){
      int yy = y + dy[k];
      int xx = x + dx[k];
      int zz = yy * M + xx;
      w = min(w, dist[zz]);
    }

    // deque<int> q;
    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>>> q;
    dist[z] = w;
    q.push({dist[z], z});
    while(q.size()){
      auto now = q.top().second;
      int d = dist[now];
      if(d < q.top().first) continue;
      q.pop();

      int y = now / M;
      int x = now % M;

      for(int k:range(4)){
        int yy = y + dy[k];
        int xx = x + dx[k];
        int zz = yy * M + xx;
        int dd = d + (val[z] >= val[zz] ? 0 : 1);
        if(dd < dist[zz]){
          dist[zz] = dd;
          q.push({dist[zz], zz});
        }
      }
    }
    ans += dist[z];
  }

  println(ans);

  return 0;
}


Measured memory_bytes: 7484