#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> p(n * n); REP(i, n * n) cin >> p[i], --p[i];
  int ans = 0;
  vector dep(n, vector(n, 0));
  REP(i, n) REP(j, n) dep[i][j] = min({i, n - 1 - i, j, n - 1 - j});
  vector exist(n, vector(n, true));
  REP(idx, n * n) {
    int y = p[idx] / n, x = p[idx] % n;
    ans += dep[y][x];
    --dep[y][x];
    exist[y][x] = false;
    {
      int cost = dep[y][x];
      for (int j = x + 1; j < n; ++j) {
        cost += exist[y][j];
        chmin(dep[y][j], cost);
      }
    }
    {
      int cost = dep[y][x];
      for (int j = x - 1; j >= 0; --j) {
        cost += exist[y][j];
        chmin(dep[y][j], cost);
      }
    }
    {
      int cost = dep[y][x];
      for (int i = y + 1; i < n; ++i) {
        cost += exist[i][x];
        chmin(dep[i][x], cost);
      }
    }
    {
      int cost = dep[y][x];
      for (int i = y - 1; i >= 0; --i) {
        cost += exist[i][x];
        chmin(dep[i][x], cost);
      }
    }
  }
  cout << ans << '\n';
  return 0;
}
