#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);
const int INF = 1e9;

int dist(const vector<pair<int, int> > &a, int gy, int gx) {
  int ret = 0;
  for (auto &[y, x] : a) {
    ret += max(abs(y - gy), abs(x - gx));
  }
  return ret;
}

int calc(const vector<pair<int, int> > &a, int n) {
  int lo = 0;
  int hi = n;

  while (hi - lo > 10) {
    int m1 = (2 * lo + hi) / 3;
    int m2 = (lo + 2 * hi) / 3;
    if (dist(a, m1, 0) < dist(a, m2, 0))
      hi = m2;
    else
      lo = m1;
  }

  int ret = INF;
  for (int i = lo; i < hi; i++)
    ret = min(ret, dist(a, i, 0));
  return ret;
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;
  vector<vector<pair<int, int> > > a(n);

  REP (i, n) REP (j, n) {
    int k;
    cin >> k;
    --k;
    a[k].emplace_back(i, j);
  }

  int ret = 0;
  REP (i, n) {
    ret += calc(a[i], n);
  }
  
  cout << ret << endl;
  
  return 0;
}