#include <bits/stdc++.h>
using namespace std;
template <class T>
void chmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void chmin(T &a, T b) {
  if (a > b) a = b;
}
constexpr long long INF = 1000000000000000000;
constexpr long long mod = 1000000007;
constexpr long double eps = 1e-8;
const long double pi = acos(-1);
long long dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
long long Random(long long mi, long long ma) {
  random_device rnd;
  mt19937 mt(rnd());
  uniform_int_distribution<long long> engine(mi, ma);
  return engine(mt);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool prime(long long a) {
  if (a == 1) return false;
  for (long long i = 2; i * i <= a; i++) {
    if (a % i == 0) return false;
  }
  return true;
}
long long modpow(long long a, long long b) {
  if (b == 0) return 1;
  if (b % 2) return modpow(a, b - 1) * a % mod;
  long long memo = modpow(a, b / 2);
  return memo * memo % mod;
}
vector<long long> kaijo, invkaijo;
void init_fact(long long n) {
  kaijo.resize(n + 1);
  invkaijo.resize(n + 1);
  kaijo[0] = 1;
  for (long long i = 1; i <= n; i++) {
    kaijo[i] = kaijo[i - 1] * i;
    kaijo[i] %= mod;
  }
  for (long long i = 0; i < n + 1; i++) invkaijo[i] = modpow(kaijo[i], mod - 2);
}
long long comb(long long a, long long b) {
  if (a < b) return 0;
  if (a < 0 || b < 0) return 0;
  return kaijo[a] * modpow(kaijo[a - b], mod - 2) % mod *
         modpow(kaijo[b], mod - 2) % mod;
}
long long inv(long long x) {
  x = modpow(x, mod - 2);
  return x;
}
long long n, p[300000], dist[510][510];
bool b[510][510];
pair<long long, long long> pos[300010];
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  for (long long i = 0; i < n * n; i++) {
    cin >> p[i];
    p[i]--;
    pos[i] = {i / n, i % n};
  }
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < n; j++) {
      dist[i][j] = min({i, j, n - i - 1, n - j - 1});
    }
  }
  long long ans = 0;
  for (long long i = 0; i < n * n; i++) {
    long long x = pos[p[i]].first, y = pos[p[i]].second;
    ans += dist[x][y];
    b[x][y] = true;
    queue<pair<long long, long long> > q;
    q.push({x, y});
    while (!q.empty()) {
      pair<long long, long long> pp = q.front();
      q.pop();
      x = pp.first, y = pp.second;
      for (long long k = 0; k < 4; k++) {
        long long X = x + dx[k], Y = y + dy[k];
        if (0 <= X && X < n && 0 <= Y && Y < n) {
          if (dist[x][y] + 1 == dist[X][Y] && b[x][y]) {
            dist[X][Y] = dist[x][y];
            q.push({X, Y});
          }
        }
      }
    }
  }
  cout << ans << endl;
  return 0;
}
