#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;

signed main() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<P> v[n];
    int a[n][n];
    rep(i, n) {
        rep(j, n) {
            cin >> a[i][j];
            a[i][j]--;
            v[a[i][j]].emplace_back(i, j);
        }
    }
    ll mn[n];
    fill(mn, mn + n, INF);
    rep(i, n) {
        rep(j, n) {
            ll sum = 0;
            rep(k, n) {
                sum += max(abs(i - v[j][k].first), v[j][k].second);
            }
            mn[j] = min(mn[j], sum);
        }
    }
    ll ans = 0;
    rep(i, n) {
        ans += mn[i];
    }
    cout << ans << endl;
    return 0;
}