#include <bits/stdc++.h>

using namespace std;

using ll = long long;

// O(N)で配列aの[start, end)の中でk番目に小さい値を求める
template<class T>
T select_kth(vector<T>& a, int start, int end, int k) {
    vector<T> v(a.begin() + start, a.begin() + end);
    nth_element(v.begin(), v.begin() + k, v.end());
    return v[k];
}

// abs(X - (x + 1)) + abs(Y - (x - 1))

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector< vector<int> > vs(n), xs(n), ys(n);
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            int a;
            cin >> a;
            --a;
            vs[a].push_back(i + j);
            vs[a].push_back(i - j);
            xs[a].push_back(i);
            ys[a].push_back(j);
        }
    }

    ll ans = 0;
    for (int i = 0; i < n; ++i) {
        int mid = select_kth(vs[i], 0, n * 2, n);
        for (int j = 0; j < n; ++j) {
            ans += max(abs(xs[i][j] - mid), abs(ys[i][j]));
        }
    }
    cout << ans << "\n";
    return 0;
}