#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 62;
int iinf = 1 << 30;
double pi = 3.141592653589793238462643383279L;
double eps = 1e-14;
int dh[4] = {1, -1, 0, 0};
int dw[4] = {0, 0, 1, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  if (k < 0) return 0;
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long poc(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
struct UF {
 private:
  vector<int> par, len, you;

 public:
  UF(int n) {
    for (int i = 0; i < n; i++) {
      par.push_back(i);
      len.push_back(0);
      you.push_back(1);
    }
  }
  int root(int n) {
    if (par[n] == n)
      return n;
    else
      return par[n] = root(par[n]);
  }
  void unit(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b) return;
    if (len[a] < len[b]) {
      par[a] = b;
      you[b] += you[a];
    } else {
      par[b] = a;
      you[a] += you[b];
      if (len[a] == len[b]) len[a]++;
    }
  }
  int yo(int a) {
    a = root(a);
    return you[a];
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  int p[n * n];
  int numm[n][n];
  for (int i = 0; i < n * n; i++) {
    cin >> p[i];
    p[i]--;
    numm[p[i] / n][p[i] % n] = i;
  }
  int r[n][n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) r[i][j] = 1;
  }
  int ans = 0;
  int dis[n][n];
  bool used[n][n];
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      dis[i][j] = min(min(i, n - i - 1), min(j, n - j - 1));
      used[i][j] = false;
    }
  }
  for (int i = 0; i < n * n; i++) {
    int nh = p[i] / n, nw = p[i] % n;
    int cnt = 0;
    int sum = 1000000000;
    for (int j = nh + 1; j < n; j++) {
      if (used[j][nw] == false) cnt++;
      sum = min(sum, cnt + dis[j][nw]);
    }
    cnt = 0;
    for (long long j = nh - 1; j >= 0; j--) {
      if (used[j][nw] == false) cnt++;
      sum = min(sum, cnt + dis[j][nw]);
    }
    cnt = 0;
    for (int j = nw + 1; j < n; j++) {
      if (used[nh][j] == false) cnt++;
      sum = min(sum, cnt + dis[nh][j]);
    }
    cnt = 0;
    for (int j = nw - 1; j < n; j++) {
      if (used[nh][j] == false) cnt++;
      sum = min(sum, cnt + dis[nh][j]);
    }
    cnt = 0;
    sum = min(sum, dis[nh][nw]);
    ans += sum;
    for (int j = nh + 1; j < n; j++) {
      dis[j][nw] = min(dis[j][nw], dis[nh][nw] + cnt);
      if (used[j][nw] == false) cnt++;
    }
    cnt = 0;
    for (long long j = nh - 1; j >= 0; j--) {
      dis[j][nw] = min(dis[j][nw], dis[nh][nw] + cnt);
      if (used[j][nw] == false) cnt++;
    }
    cnt = 0;
    for (int j = nw + 1; j < n; j++) {
      dis[nh][j] = min(dis[nh][j], dis[nh][nw] + cnt);
      if (used[nh][j] == false) cnt++;
    }
    cnt = 0;
    for (long long j = nw - 1; j >= 0; j--) {
      dis[nh][j] = min(dis[nh][j], dis[nh][nw] + cnt);
      if (used[nh][j] == false) cnt++;
    }
    used[nh][nw] = true;
  }
  cout << ans << endl;
}
