#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};
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;
  }
  int ans = 0;
  vector<vi32> f(n, vi32(n));
  for (int i = 0; i < int(n * n); i++) {
    int x = p[i] % n;
    int y = p[i] / n;
    using T = tuple<int, int, int>;
    deque<T> q;
    q.emplace_front(x, y, 0);
    vector<pair<int, int>> history;
    int co = -1;
    while (((int)q.size())) {
      int x, y, cost;
      tie(x, y, cost) = q.front();
      q.pop_front();
      if (f[x][y]) continue;
      f[x][y] = 1;
      history.emplace_back(x, y);
      if (x == 0 || x == n - 1 || y == 0 || y == n - 1) {
        co = cost;
        break;
      }
      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[nx][ny] < i) {
          q.emplace_front(nx, ny, cost);
        } else {
          q.emplace_back(nx, ny, cost + 1);
        }
      }
    }
    ans += co;
    for (auto h : history) {
      int x, y;
      tie(x, y) = h;
      f[x][y] = 0;
    }
  }
  cout << ans << endl;
}
