#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int N; cin >> N;
  vector<vector<int>> A(N, vector<int>(N));
  rep(i, N) rep(j, N) cin >> A[i][j], A[i][j]--;
  vector<vector<int>> S0(N, vector<int>(N + 1));
  vector<vector<int>> S1(N, vector<int>(N + 1));
  auto add = [&](vector<int> &a0, vector<int> &a1, int l, int r, int x0, int x1) {
    a0[l] += x0;
    a0[r] -= x0;
    a1[l] += x1;
    a1[r] -= x1;
  };
  rep(i, N) rep(j, N) {
    int l = max(0, i - j);
    int r = min(N, i + j);
    add(S0[A[i][j]], S1[A[i][j]], 0, l, i, -1);
    add(S0[A[i][j]], S1[A[i][j]], l, r, j, 0);
    add(S0[A[i][j]], S1[A[i][j]], r, N, -i, 1);
  }
  rep(i, N) rep(j, N) {
    S0[i][j + 1] += S0[i][j];
    S1[i][j + 1] += S1[i][j];
  }
  int ans = 0;
  rep(i, N) {
    int mn = INT_MAX;
    rep(j, N) mn = min(mn, S0[i][j] + S1[i][j] * j);
    ans += mn;
  }
  cout << ans << endl;
}