#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}
template <class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  for (int i = 0; i < int(a.size()); ++i)
    out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}
void smain();
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(12) << fixed;
  smain();
  return 0;
}
vector<int> di = {0, 0, -1, 1};
vector<int> dj = {-1, 1, 0, 0};
void solve() {
  int n;
  cin >> n;
  vector<int> p(n * n);
  for (int i = 0; i < int(n * n); ++i) {
    cin >> p[i];
    p[i]--;
  }
  vector<vector<int> > d(n, vector<int>(n, 0));
  vector<vector<int> > used(n, vector<int>(n, 0));
  for (int i = 0; i < int(n); ++i) {
    for (int j = 0; j < int(n); ++j) {
      d[i][j] = min(min(i, n - i - 1), min(j, n - j - 1));
    }
  }
  auto in_bound = [&](int i, int j) -> bool {
    return i >= 0 && i < n && j >= 0 && j < n;
  };
  auto change = function<void(int, int)>();
  change = [&](int i, int j) -> void {
    int ret = n * n;
    for (int dir = 0; dir < int(di.size()); ++dir) {
      int ii = i + di[dir];
      int jj = j + dj[dir];
      if (in_bound(ii, jj))
        ret = min(ret, (d[ii][jj]));
      else
        ret = 0;
    }
    ret += !used[i][j];
    if (ret != d[i][j]) {
      d[i][j] = ret;
      for (int dir = 0; dir < int(di.size()); ++dir) {
        int ii = i + di[dir];
        int jj = j + dj[dir];
        if (in_bound(ii, jj)) change(ii, jj);
      }
    }
  };
  long long ans = 0;
  for (auto x : p) {
    int i = x / n, j = x % n;
    used[i][j] = 1;
    change(i, j);
    ans += d[i][j];
  }
  cout << ans << '\n';
}
void smain() { solve(); }
