#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;
}
const int N = 505;
bool taken[N][N];
const int L = 6e5 + 10;
const int MID = 3e5 + 10;
pair<int, int> q[L];
int d[N][N];
int used[N][N][2];
vector<int> di = {0, 0, -1, 1};
vector<int> dj = {-1, 1, 0, 0};
const int oo = 1e9 + 10;
void smain() {
  int n;
  cin >> n;
  for (int i = 0; i < int(n); ++i) {
    for (int j = 0; j < int(n); ++j) {
      taken[i][j] = true;
    }
  }
  long long ans = 0;
  for (int _ = 0; _ < int(n * n); ++_) {
    for (int i = 0; i < int(n); ++i) {
      for (int j = 0; j < int(n); ++j) {
        d[i][j] = oo;
        used[i][j][0] = used[i][j][1] = 0;
      }
    }
    int cur;
    cin >> cur;
    cur--;
    int x = cur / n;
    int y = cur % n;
    taken[x][y] = false;
    int ql = MID;
    int qr = MID;
    q[qr++] = {x, y};
    used[x][y][0] = true;
    d[x][y] = 0;
    int cans = n * n;
    while (ql < qr) {
      pair<int, int> cur = q[ql++];
      int x = cur.first, y = cur.second;
      if (x == 0 || x == n - 1 || y == 0 || y == n - 1) {
        cans = min(cans, (d[x][y]));
        continue;
      }
      for (int dir = 0; dir < int(di.size()); ++dir) {
        int xx = x + di[dir];
        int yy = y + dj[dir];
        if (taken[xx][yy] && !used[xx][yy][1]) {
          used[xx][yy][1] = true;
          d[xx][yy] = min(d[xx][yy], (d[x][y] + 1));
          q[qr++] = {xx, yy};
        }
        if (!taken[xx][yy] && !used[xx][yy][0]) {
          used[xx][yy][0] = true;
          d[xx][yy] = min(d[xx][yy], (d[x][y]));
          q[--ql] = {xx, yy};
        }
      }
    }
    ans += cans;
  }
  cout << ans;
}
