#include <bits/stdc++.h>
const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;
using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
bool paircomp(const pair<ll, ll> &a, const pair<ll, ll> &b) {
  if (a.first == b.first) return a.second < b.second;
  return a.first < b.first;
}
ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vl P(N * N);
  for (ll i = 0; i < (N * N); i++) cin >> P[i];
  vvl G = vector<vector<ll>>(N, vector<ll>(N, 1));
  ll ans = 0;
  for (ll i = 0; i < (N * N); i++) {
    P[i]--;
    ll x = P[i] % N;
    ll y = P[i] / N;
    ll p = llINF;
    ll count = 0;
    for (ll j = 0; j < (x); j++) {
      count += G[y][j];
    }
    p = min(p, count);
    count = 0;
    for (ll j = 0; j < (y); j++) {
      count += G[j][x];
    }
    p = min(p, count);
    count = 0;
    for (ll j = (y + 1); j < (N); j++) {
      count += G[j][x];
    }
    p = min(p, count);
    count = 0;
    for (ll j = (x + 1); j < (N); j++) {
      count += G[y][j];
    }
    p = min(p, count);
    ans += p;
    G[y][x] = 0;
  }
  cout << ans << endl;
  return 0;
}
