#include <bits/stdc++.h>
using namespace std;
using Pair = pair<int, int>;

int main() {
    int N; cin >> N;
    vector<vector<Pair>> pos(N);
    for(int i = 0; i < N; ++i) {
        for(int j = 0; j < N; ++j) {
            int a; cin >> a; a--;
            pos[a].emplace_back(i, j);
        }
    }
    int ans = 0;
    for(int a = 0; a < N; ++a) {
        auto f = [&](int x) -> int {
            int res = 0;
            for(auto &[i, j] : pos[a]) res += max(abs(x - i), j);
            return res;
        };
        int l = 0, r = N - 1;
        while(l + 2 < r) {
            int c1 = (l * 2 + r) / 3;
            int c2 = (l + r * 2) / 3;
            if(f(c1) > f(c2)) l = c1;
            else r = c2;
        }
        int mn = f(r);
        for(int i = l; i < r; ++i) mn = min(mn, f(i));
        ans += mn;
    }
    cout << ans << '\n';
    return 0;
}