#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e3 + 10;
int n, a[N][N], f[N * N], ans[N * N];
pair<int, int> pos[N * N];
void chkmin(int &a, int b) { a = min(a, b); }
int main() {
  scanf("%d", &n);
  int now = 0;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j) {
      a[i][j] = ++now;
      pos[now] = pair<int, int>(i, j);
      ans[now] = min({n - i, i - 1, n - j, j - 1});
    }
  int tot = 0;
  for (int i = 1; i <= n * n; ++i) {
    scanf("%d", f + i);
    tot += ans[f[i]];
    pair<int, int> u = pos[f[i]];
    a[u.first][u.second] = 0;
    int t = ans[f[i]];
    for (int k = u.first + 1; k <= n; ++k) {
      chkmin(ans[a[k][u.second]], t);
      t += !!a[k][u.second];
    }
    t = ans[f[i]];
    for (int k = u.first - 1; k >= 1; --k) {
      chkmin(ans[a[k][u.second]], t);
      t += !!a[k][u.second];
    }
    t = ans[f[i]];
    for (int k = u.second + 1; k <= n; ++k) {
      chkmin(ans[a[u.first][k]], t);
      t += !!a[u.first][k];
    }
    t = ans[f[i]];
    for (int k = u.second - 1; k >= 1; --k) {
      chkmin(ans[a[u.first][k]], t);
      t += !!a[u.first][k];
    }
  }
  printf("%d\n", tot);
}
