#include <bits/stdc++.h>
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const long double eps = 1e-12;
const long double pi = acos(-1.0);
void chmin(long long &a, long long b) { a = min(a, b); }
void chmax(long long &a, long long b) { a = max(a, b); }
long long mod_pow(long long a, long long n, long long m = mod) {
  a %= m;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint &a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint &a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int a[500][500];
int id[500][500][501];
void solve() {
  int n;
  cin >> n;
  vector<int> in(n * n);
  for (int i = 0; i < n * n; i++) cin >> in[i];
  for (int i = 0; i < n * n; i++) {
    in[i]--;
    a[in[i] / n][in[i] % n] = i + 1;
  }
  int sup = n * n + 1;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < n + 1; k++) id[i][j][k] = sup;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      if (i == 0 || j == 0 || i == n - 1 || j == n - 1) {
        id[i][j][0] = a[i][j];
        id[i][j][1] = 0;
      }
    }
  for (int k = 0; k < n + 1; k++) {
    vector<queue<pair<int, int>>> qs(sup + 1);
    for (int i = 0; i < n; i++)
      for (int j = 0; j < n; j++) {
        qs[id[i][j][k]].push({i, j});
      }
    for (int t = 0; t < sup + 1; t++) {
      while (!qs[t].empty()) {
        pair<int, int> p = qs[t].front();
        qs[t].pop();
        int x = p.first, y = p.second;
        if (id[x][y][k] < t) continue;
        for (int d = 0; d < 4; d++) {
          int nx = x + dx[d], ny = y + dy[d];
          if (nx < 0 || ny < 0 || nx == n - 1 || ny == n - 1) continue;
          int td = max(a[nx][ny], id[x][y][k]);
          if (td < id[nx][ny][k]) {
            id[nx][ny][k] = td;
            qs[td].push({nx, ny});
          }
        }
      }
    }
    if (k < n) {
      for (int x = 0; x < n; x++)
        for (int y = 0; y < n; y++) {
          for (int d = 0; d < 4; d++) {
            int nx = x + dx[d], ny = y + dy[d];
            if (nx < 0 || ny < 0 || nx == n - 1 || ny == n - 1) continue;
            id[nx][ny][k + 1] = min(id[nx][ny][k + 1], id[x][y][k]);
          }
        }
    }
  }
  long long ans = 0;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) {
      int z = 0;
      for (int k = 0; k < n + 1; k++)
        if (id[i][j][k] == a[i][j]) {
          z = k;
          break;
        }
      ans += z;
    }
  cout << ans << "\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  char nyaa;
  cin >> nyaa;
  return 0;
}
