#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
  if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
  if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template <class t>
using vvc = vc<vc<t>>;
using pi = pair<int, int>;
using vi = vc<int>;
template <class t, class u>
ostream& operator<<(ostream& os, const pair<t, u>& p) {
  return os << "{" << p.first << "," << p.second << "}";
}
template <class t>
ostream& operator<<(ostream& os, const vc<t>& v) {
  os << "{";
  for (auto e : v) os << e << ",";
  return os << "}";
}
using uint = unsigned;
using ull = unsigned long long;
template <class t, size_t n>
ostream& operator<<(ostream& os, const array<t, n>& first) {
  return os << vc<t>(first.begin(), first.end());
}
template <int i, class T>
void print_tuple(ostream&, const T&) {}
template <int i, class T, class H, class... Args>
void print_tuple(ostream& os, const T& t) {
  if (i) os << ",";
  os << get<i>(t);
  print_tuple<i + 1, T, Args...>(os, t);
}
template <class... Args>
ostream& operator<<(ostream& os, const tuple<Args...>& t) {
  os << "{";
  print_tuple<0, tuple<Args...>, Args...>(os, t);
  return os << "}";
}
template <class t>
void print(t x, int suc = 1) {
  cout << x;
  if (suc == 1) cout << "\n";
  if (suc == 2) cout << " ";
}
ll read() {
  ll i;
  cin >> i;
  return i;
}
vi readvi(int n, int off = 0) {
  vi v(n);
  for (int i = int(0); i < int(n); i++) v[i] = read() + off;
  return v;
}
template <class T>
void print(const vector<T>& v, int suc = 1) {
  for (int i = int(0); i < int(v.size()); i++)
    print(v[i], i == int(v.size()) - 1 ? suc : 2);
}
string readString() {
  string s;
  cin >> s;
  return s;
}
template <class T>
T sq(const T& t) {
  return t * t;
}
void yes(bool ex = true) {
  cout << "Yes"
       << "\n";
  if (ex) exit(0);
}
void no(bool ex = true) {
  cout << "No"
       << "\n";
  if (ex) exit(0);
}
void possible(bool ex = true) {
  cout << "Possible"
       << "\n";
  if (ex) exit(0);
}
void impossible(bool ex = true) {
  cout << "Impossible"
       << "\n";
  if (ex) exit(0);
}
constexpr ll ten(int n) { return n == 0 ? 1 : ten(n - 1) * 10; }
const ll infLL = LLONG_MAX / 3;
const int inf = INT_MAX / 2 - 100;
int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }
int topbit(ll t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }
int botbit(signed first) { return first == 0 ? 32 : __builtin_ctz(first); }
int botbit(ll first) { return first == 0 ? 64 : __builtin_ctzll(first); }
int popcount(signed t) { return __builtin_popcount(t); }
int popcount(ll t) { return __builtin_popcountll(t); }
bool ispow2(int i) { return i && (i & -i) == i; }
ll mask(int i) { return (ll(1) << i) - 1; }
bool inc(int first, int second, int c) {
  return first <= second && second <= c;
}
template <class t>
void mkuni(vc<t>& v) {
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
}
ll rand_int(ll l, ll r) {
  static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
  return uniform_int_distribution<ll>(l, r)(gen);
}
template <class t>
void myshuffle(vc<t>& first) {
  for (int i = int(0); i < int(int(first.size())); i++)
    swap(first[i], first[rand_int(0, i)]);
}
template <class t>
int lwb(const vc<t>& v, const t& first) {
  return lower_bound(v.begin(), v.end(), first) - v.begin();
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout << fixed << setprecision(20);
  int n;
  cin >> n;
  vvc<int> first(n, vi(n));
  for (int i = int(0); i < int(n * n); i++) {
    int x;
    cin >> x;
    x--;
    first[x / n][x % n] = i;
  }
  vvc<int> z(n, vi(n, inf));
  for (int i = int(0); i < int(n); i++)
    for (int j = int(0); j < int(n); j++)
      if (i == 0 || i == n - 1 || j == 0 || j == n - 1) z[i][j] = first[i][j];
  vvc<int> done(n, vi(n));
  ll ans = 0;
  const int dyx[]{-1, 0, 1, 0, -1};
  vvc<int> idx(n * n);
  for (int step = int(0); step < int(n); step++) {
    for (int i = int(0); i < int(n * n); i++) idx[i].clear();
    for (int i = int(0); i < int(n); i++)
      for (int j = int(0); j < int(n); j++)
        if (z[i][j] < n * n) idx[z[i][j]].push_back(i * n + j);
    void(0);
    for (int dist = int(0); dist < int(n * n); dist++)
      for (int w = int(0); w < int(int(idx[dist].size())); w++) {
        int i = idx[dist][w] / n, j = idx[dist][w] % n;
        if (z[i][j] != dist) continue;
        for (int dir = int(0); dir < int(4); dir++) {
          int y = i + dyx[dir], x = j + dyx[dir + 1];
          if (inc(0, y, n - 1) && inc(0, x, n - 1)) {
            int v = max(first[y][x], z[i][j]);
            if (z[y][x] > v) {
              idx[z[y][x] = v].push_back(y * n + x);
            }
          }
        }
      }
    void(0);
    for (int i = int(0); i < int(n); i++)
      for (int j = int(0); j < int(n); j++)
        if (!done[i][j] && z[i][j] <= first[i][j]) {
          ans += step;
          done[i][j] = 1;
        }
    vvc<int> nx = z;
    for (int i = int(0); i < int(n); i++)
      for (int j = int(0); j < int(n); j++)
        if (i == 0 || i == n - 1 || j == 0 || j == n - 1) nx[i][j] = 0;
    for (int i = int(0); i < int(n); i++)
      for (int j = int(0); j < int(n); j++)
        for (int dir = int(0); dir < int(4); dir++) {
          int y = i + dyx[dir], x = j + dyx[dir + 1];
          if (inc(0, y, n - 1) && inc(0, x, n - 1)) chmin(nx[y][x], z[i][j]);
        }
    z = nx;
  }
  print(ans);
}
