#include <bits/stdc++.h>
using namespace std;
#define BIT(n) (1LL << (n))
#define BITF(n, i) (((n) >> (i)) & 1)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define REPI(i, x) for (int i = 1; i <= x; i++)
#define FORI(i, m, n) for (int i = m; i <= n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define REPZ(i, x) for (int i = 0; i <= x; i++)
#define FORA(i, n) for (auto &&i : n)
#define POW(a, b) ((int)(pow(a, b) + .5))
#define MODULO(a, b) (((a) % (b)) < 0 ? (a) % (b) + (b) : (a) % (b))
#define DUMPOUT cerr
// vector
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec) is >> x;
  return is;
}
// pair
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
  os << "(" << pair_var.first << ", " << pair_var.second << ")";
  return os;
}
// vector
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
  os << "{";
  REP(i, (int)vec.size())
  os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", ");
  os << "}";
  return os;
}
// map
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) {
  os << "{";
  FORA(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
// set
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
  os << "{";
  FORA(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end()) os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) > 0) DUMPOUT << ", ";
  dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define DUMP(...)                                                             \
  DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                             \
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
          << "    ",                                                          \
      dump_func(__VA_ARGS__)
#define PRINTARR(x, y)                                     \
  cerr << #x << "=\n";                                     \
  for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \
  cerr << endl;
#define PRINTARR2(x, i0, i1)                                       \
  cerr << #x << "=\n";                                             \
  for (int ii0 = 0; ii0 < i0; ii0++) {                             \
    for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \
    cerr << endl;                                                  \
  }
#else
#define DEB if (false)
#define DUMP(...)
#define PRINTARR(x, y)
#define PRINTARR2(x, i0, i1)
#endif
#define ALL(v) v.begin(), v.end()
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define epb emplace_back
#define int long long
#define pint pair<int, int>
#define pdouble pair<double, double>
#define ld long double
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> using vec = std::vector<T>;
template <class T> void print(const T &x) { cout << x << "\n"; }
const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0;
const double EPS = 1e-7, PI = acos(-1.0);
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
/*
[&] { return; }();下のスラッシュを2つ追加しただけ.上のスラッシュを2つにすれば外れる.
//*/
#define MAXN 550
int t[MAXN][MAXN];
int cost[MAXN][MAXN];
int cost2[MAXN][MAXN];
int N;
void bfs(int v0, int v1, int id) {
  queue<pint> q;
  q.push(mp(v0, v1));
  while (!q.empty()) {
    pint ele = q.front();
    int ret = t[ele.fst][ele.snd];
    int c0 = cost[ele.fst][ele.snd];
    q.pop();
    REP(i, 4) {
      pint next = mp(ele.fst + dx[i], ele.snd + dy[i]);
      if (0 <= next.fst && next.fst < N && 0 <= next.snd && next.snd < N) {
        int val = t[next.fst][next.snd];
        int c1 = cost[next.fst][next.snd];

        if (val <= id && c0 > c1) {
          cost[ele.fst][ele.snd] = c1;
          q.push(mp(ele.fst, ele.snd));
        }
        if (ret <= id && c1 > c0) {
          cost[next.fst][next.snd] = c0;
          q.push(mp(next.fst, next.snd));
        }
        if (val > id && c0 > c1 + 1) {
          cost[ele.fst][ele.snd] = c1 + 1;
          q.push(mp(ele.fst, ele.snd));
        }
        if (ret > id && c1 > c0 + 1) {
          cost[next.fst][next.snd] = c0 + 1;
          q.push(mp(next.fst, next.snd));
        }
      }
    }
  }
}
signed main() {
  cin.tie(0), ios::sync_with_stdio(false);
  cout << fixed << setprecision(12);
  cin >> N;
  int N2 = N * N;
  vec<pint> lis;
  REP(i, N2) {
    int p;
    cin >> p;
    p--;
    t[p / N][p % N] = i;
    lis.pb(mp(p / N, p % N));
  }
  REP(i, N2) {
    int i0 = i / N;
    int i1 = i % N;
    cost[i0][i1] = min({i0, i1, N - 1 - i0, N - 1 - i1});
  }
  int ans = 0;
  PRINTARR2(t, N, N);
  REP(i, N2) {
    pint ele = lis[i];
    int v0 = ele.fst;
    int v1 = ele.snd;
    int ret = cost[v0][v1];
    REP(j, 4) {
      int w0 = v0 + dx[j];
      int w1 = v1 + dy[j];
      if (0 <= w0 && w0 < N && 0 <= w1 && w1 < N) chmin(ret, cost[w0][w1] + (t[w0][w1] > t[v0][v1]));
    }
    ans += ret;
    DUMP(ret);
    bfs(v0, v1, i);

    PRINTARR2(cost, N, N);
  }

  print(ans);
}

Measured memory_bytes: 11616