#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int SZ = 1e5 + 4;
const double EPS = 1e-7;
const int mod = 1e9 + 7;
const int hashpow = 2;
const int inf = 2e9;
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
int n;
int a[SZ];
inline void read() {
  cin >> n;
  for (int i = 0; i < n * n; ++i) {
    cin >> a[i];
    --a[i];
  }
}
inline void solve() {
  vector<vector<char>> q(n, vector<char>(n, true));
  int ans = 0;
  for (int i = 0; i < n * n; ++i) {
    vector<vector<int>> d(n, vector<int>(n, inf));
    deque<pair<int, int>> s;
    int x = a[i] / n, y = a[i] % n;
    s.emplace_front(x, y);
    q[x][y] = false;
    d[x][y] = 0;
    while (!s.empty()) {
      pair<int, int> u = s.front();
      if (u.first == 0 || u.second == 0 || u.first == n - 1 ||
          u.second == n - 1) {
        ans += d[u.first][u.second];
        break;
      }
      s.pop_front();
      vector<pair<int, int>> g;
      g.emplace_back(u.first - 1, u.second);
      g.emplace_back(u.first + 1, u.second);
      g.emplace_back(u.first, u.second - 1);
      g.emplace_back(u.first, u.second + 1);
      for (auto [v, w] : g) {
        if (d[v][w] > d[u.first][u.second] + q[v][w]) {
          d[v][w] = d[u.first][u.second] + q[v][w];
          if (q[v][w]) {
            s.emplace_back(v, w);
          } else {
            s.emplace_front(v, w);
          }
        }
      }
    }
  }
  cout << ans << "\n";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  read();
  solve();
  return 0;
}
