#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using f80 = long double;
using vi32 = vector<int>;
using vi64 = vector<i64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
void yes() {
  cout << "Yes" << endl;
  exit(0);
}
void no() {
  cout << "No" << endl;
  exit(0);
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T>
void amax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
void amin(T &x, T y) {
  x = min(x, y);
}
template <typename T>
T exp(T x, i64 n, T e = 1) {
  T r = e;
  while (n > 0) {
    if (n & 1) r *= x;
    x *= x;
    n >>= 1;
  }
  return r;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
  for (int i = 0; i < int(v.size()); i++) {
    if (i) os << ' ';
    os << v[i];
  }
  return os;
}
void solve();
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout << fixed << setprecision(16);
  solve();
  return 0;
}
const int INF = 1001001001;
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
struct UnionFind {
  vector<int> data;
  vector<int> minv;
  UnionFind(int n) {
    data.assign(n, -1);
    minv.assign(n, INF);
  }
  pair<int, int> root(int k, int v) {
    if (data[k] < 0) {
      minv[k] = min(minv[k], v);
      return pair<int, int>(k, minv[k]);
    }
    auto temp = root(data[k], minv[k]);
    data[k] = temp.first;
    minv[k] = min(minv[k], temp.second);
    temp.second = minv[k];
    return temp;
  }
  void unite(int x, int y) {
    x = root(x, INF).first;
    y = root(y, INF).first;
    if (x == y) return;
    if (data[x] > data[y]) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    minv[x] = min(minv[x], minv[y]);
  }
  bool same(int x, int y) { return root(x, INF) == root(y, INF); }
  int size(int k) { return -data[root(k, INF).first]; }
  int minvalue(int x) { return minv[root(x, INF).first]; }
};
void solve() {
  int n;
  cin >> n;
  vi32 p(n * n);
  cin >> p;
  for (int i = 0; i < int(n * n); i++) p[i]--;
  vector<vi32> b(n, vi32(n));
  for (int i = 0; i < int(n * n); i++) {
    int x = p[i] % n;
    int y = p[i] / n;
    b[x][y] = i;
  }
  UnionFind uf(n * n);
  for (int i = 0; i < int(n); i++)
    for (int j = 0; j < int(n); j++) {
      int mi = min({i, n - i - 1, j, n - j - 1});
      uf.minv[b[i][j]] = mi;
    }
  i64 ans = 0;
  for (int i = 0; i < int(n * n); i++) {
    int x = p[i] % n;
    int y = p[i] / n;
    for (int k = 0; k < int(4); k++) {
      int nx = x + dx[k];
      int ny = y + dy[k];
      if (nx < 0 || nx >= n || ny < 0 || ny >= n) continue;
      if (b[x][y] > b[nx][ny]) {
        uf.unite(b[x][y], b[nx][ny]);
      }
    }
    ans += uf.minvalue(b[x][y]);
  }
  cout << ans << endl;
}
