#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i,n) for(int i=0;i<n;i++)
#define REPP(i,n) for(int i=1;i<=n;i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
//const double PI = acos(-1);
//const double EPS = 1e-15;
//long long INF=(long long)1E17;
#define i_7 (long long)(1e9+7)
//#define i_7 998'244'353
long mod(long a){
    long long c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
long long po(long a, long b){
    if(b==0){
        return 1;
    }
    
    long long z = po(a,b/2);
    z = mod(z*z);
    if(b%2!=0){
        z = mod(a*z);
    }
    return z;
}
 
bool prime_(int n){
  if(n==1){
    return false;
  }else if(n==2){
    return true;
  }else{
    for(int i=2;i<=std::sqrt(n);i++){
      if(n%i==0){
        return false;
      }
    }
    return true;
  }
}
 
long long gcd_(long long a, long long b){
  if(a<b){
    std::swap(a,b);
  }
  if(a%b==0){
    return b;
  }else{
    return gcd_(b,a%b);
  }
}
 
long long lcm_(long long x, long long y){
  return (x/gcd_(x,y))*y;
}
 
//using namespace std;
//using namespace boost::multiprecision;
//using namespace __gnu_pbds;

int main(){
  using namespace std;
  int n;
  cin>>n;
  int p[n * n];
  REP(i, n) {
    cin>>p[i];
    p[i]--;
  }
  auto valid = [&n](int i, int j) -> bool {
    return 0 <= i && i < n && 0 <= j && j < n;
  };
  auto conv = [&n](int i, int j) -> int {
    return n * i + j;
  };
  int dist[n][n];
  REP(i, n){
    REP(j, n){
      int x = min(i, n - 1 - i);
      int y = min(j, n - 1 - j);
      dist[i][j] = min(x, y);
    }
  }
  bool exists[n][n];
  REP(i, n) REP(j, n) exist[i][j] = true;
  int ans = 0;
  typedef pair<int, int> P;
  int dx[] = {1, 0, -1, 0};
  int dy[] = {0, 1, 0, -1};
  REP(num, n * n){
    int i = num / n;
    int j = num % n;
    exists[i][j] = false;
    ans += dist[i][j];
    queue<P> q;
    q.push(P(i, j));
    while(!q.empty()){
      P p = q.top();
      q.pop();
      int x = p.first, y = p.second;
      REP(k, 4){
        int nx = x + dx[k], ny = y + dy[k];
        if(!valid(nx, ny)) continue;
        if(exists[x][y]){
          if(dist[x][y] + 1 < dist[nx][ny]){
            dist[nx][ny] = dist[x][y] + 1;
            q.push(P(nx, ny));
          }
        }else{
          if(dist[x][y] < dist[nx][ny]){
            dist[nx][ny] = dist[x][y];
            q.push(P(nx, ny));
          }
        }
      }
    }
  }
  cout << ans << endl;   
  return 0;
}
