#include <bits/stdc++.h>
long long dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
 public:
  long long x;
  long long y, z;
  pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  long long x;
  long long y, z, w;
  pa4(long long x = 0, long long y = 0, long long z = 0, long long w = 0)
      : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  long long x, y;
  pa2(long long x = 0, long long y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
string itos(long long i) {
  ostringstream s;
  s << i;
  return s.str();
}
long long gcd(long long v, long long b) {
  if (v == 0) return b;
  if (b == 0) return v;
  if (v > b) return gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return gcd(v, b % v);
}
long long mod;
long long extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<long long, long long> operator+(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first + r.first, l.second + r.second};
}
pair<long long, long long> operator-(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first - r.first, l.second - r.second};
}
long long beki(long long wa, long long rr, long long warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
long long pr[1000100];
long long inv[1000010];
long long comb(long long nn, long long rr) {
  if (rr < 0 || rr > nn || nn < 0) return 0;
  long long r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(long long ert) {
  pr[0] = 1;
  for (long long i = 1; i <= ert; i++) {
    pr[i] = ((long long)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (long long i = ert - 1; i >= 0; i--) {
    inv[i] = (long long)inv[i + 1] * (i + 1) % mod;
  }
}
vector<pair<long long, long long> > hoge[300000];
long long n;
struct unionfind {
 private:
 public:
  vector<long long> par, ranks, kosuu;
  void shoki(long long N) {
    par.resize(N + 1, 0);
    ranks.resize(N + 1, 0);
    kosuu.resize(N + 1, 1);
    for (long long i = 0; i <= N; i++) {
      par[i] = i;
      hoge[i].push_back(make_pair(i / (n + 2), i % (n + 2)));
    }
  }
  long long root(long long x) {
    return par[x] == x ? x : par[x] = root(par[x]);
  }
  bool same(long long x, long long y) { return root(x) == root(y); }
  bool is_root(long long x) { return x == root(x); }
  void unite(long long x, long long y) {
    x = root(x);
    y = root(y);
    long long xx = kosuu[x], yy = kosuu[y];
    if (x == y) return;
    if (ranks[x] < ranks[y]) {
      par[x] = y;
      kosuu[y] = yy + xx;
      while (hoge[x].size()) {
        hoge[y].push_back(hoge[x].back());
        hoge[x].pop_back();
      }
    } else {
      par[y] = x;
      if (ranks[x] == ranks[y]) ranks[x] = ranks[x] + 1;
      kosuu[x] = yy + xx;
      while (hoge[y].size()) {
        hoge[x].push_back(hoge[y].back());
        hoge[y].pop_back();
      }
    }
    return;
  }
};
unionfind uf;
long long a[510][510] = {};
long long dis[510][510] = {};
long long ch(long long x, long long y) { return (n + 2) * x + y; }
long long sumi[300000] = {};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  uf.shoki((n + 2) * (n + 2));
  vector<long long> P(n * n);
  for (long long i = 0; i < n * n; i++) cin >> P[i];
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= n; j++) a[i][j] = 1;
  for (long long i = 0; i <= n + 1; i++)
    for (long long j = 0; j <= n + 1; j++) {
      dis[i][j] = min({i, j, n + 1 - i, n + 1 - j});
    }
  long long ans = 0;
  for (long long i = 1; i <= n * n; i++) {
    long long r = P[i - 1];
    long long x = (r - 1) / n + 1;
    long long y = (r - 1) % n + 1;
    a[x][y] = 0;
    queue<pair<long long, long long> > qu;
    dis[x][y]--;
    long long ne = dis[x][y];
    for (long long t = 0; t < 4; t++) {
      long long X = x + dx[t];
      long long Y = y + dy[t];
      if (X > 0 && Y > 0 && X <= n && Y <= n)
        if (a[X][Y] == 0) {
          uf.unite(ch(x, y), ch(X, Y));
          ne = min(ne, dis[X][Y]);
        }
    }
    qu.push(make_pair(uf.root(ch(x, y)), ne));
    while (qu.size()) {
      pair<long long, long long> z = qu.front();
      qu.pop();
      if (sumi[z.first] == i) continue;
      sumi[z.first] = i;
      for (auto v : hoge[z.first]) {
        dis[v.first][v.second] = z.second;
      }
      for (auto v : hoge[z.first]) {
        for (long long t = 0; t < 4; t++) {
          long long X = dx[t] + v.first;
          long long Y = dy[t] + v.second;
          if (X > 0 && Y > 0 && X <= n && Y <= n)
            if (!uf.same(ch(X, Y), ch(x, y)))
              if (dis[X][Y] > z.second + 1) {
                qu.push(make_pair(uf.root(ch(X, Y)), z.second + 1));
              }
        }
      }
    }
    ans += dis[x][y];
  }
  cout << ans << endl;
  return 0;
}
