#include <bits/stdc++.h>
using namespace std;
const int N = 501;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
char dir[] = {'L', 'D', 'R', 'U'};
const long long int mod = 1e9 + 7;
const long long int inf = 1e18 + 100;
int BIT[501][501], BIT2[501][501], n;
int prime[17], spf[17];
template <typename T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <typename T>
T min3(T a, T b, T c) {
  return min(a, min(b, c));
}
template <typename T>
T max3(T a, T b, T c) {
  return max(a, max(b, c));
}
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
long long int mInv(long long int a, long long int m) {
  long long int m0 = m;
  long long int y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long int q = a / m;
    long long int t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long int power(long long int x, long long int y) {
  long long int res = 1;
  x = x % mod;
  while (y > 0) {
    if (y & 1) res = (res * x) % mod;
    y = y >> 1;
    x = (x * x) % mod;
  }
  return res;
}
long long int gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void update(int x, int delta, int r) {
  if (!x) {
    BIT[r][x] += delta;
    return;
  }
  for (; x <= n; x += x & -x) BIT[r][x] += delta;
}
void update1(int x, int delta, int c) {
  if (!x) {
    BIT2[x][c] += delta;
    return;
  }
  for (; x <= n; x += x & -x) BIT2[x][c] += delta;
}
long long int query(int x, int r) {
  long long int sum = BIT[r][0];
  for (; x > 0; x -= x & -x) sum += BIT[r][x];
  return sum;
}
long long int query1(int x, int c) {
  long long int sum = BIT2[0][c];
  for (; x > 0; x -= x & -x) sum += BIT2[x][c];
  return sum;
}
void Sieve() {
  for (int i = 1; i <= N; i++) prime[i] = 1;
  prime[0] = 0;
  prime[1] = 0;
  for (long long int p = 2; p * p <= N; p++) {
    if (prime[p] == 1) {
      for (long long int i = p * p; i <= N; i += p) prime[i] = 0;
    }
  }
  for (int p = 3; p <= N; p++) prime[p] += prime[p - 1];
}
void sieve() {
  spf[1] = 1;
  for (int i = 2; i < N; i++) spf[i] = i;
  for (int i = 4; i < N; i += 2) spf[i] = 2;
  for (long long int i = 3; i * i < N; i++) {
    if (spf[i] == i) {
      for (long long int j = i * i; j < N; j += i)
        if (spf[j] == j) spf[j] = i;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    memset(BIT, 0, sizeof(BIT));
    memset(BIT2, 0, sizeof(BIT2));
    cin >> n;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= n; j++) {
        update(j, 1, i);
        update1(i, 1, j);
      }
    int x;
    long long int ans = 0;
    for (int i = 0; i < n * n; i++) {
      cin >> x;
      int r = (x - 1) / n;
      r++;
      int c = x % n;
      if (c == 0) c = n;
      long long int a = query(c - 1, r);
      long long int b = query(n, r);
      b = b - a - 1;
      long long int ca = query1(r - 1, c);
      long long int d = query1(n, c);
      d = d - ca - 1;
      long long int u = min(a, b);
      long long int v = min(ca, d);
      ans += min(u, v);
      update(c, -1, r);
      update1(r, -1, c);
    }
    cout << ans << "\n";
  }
  return 0;
}
