#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N;
    cin >> N;
    vector<vector<int>> A(N, vector<int>(N));
    vector<ll> res(N, INF), num(N);
    vector<int> inc(N), dec(N);
    rep(i, N) {
        rep(j, N) {
            cin >> A[i][j];
            A[i][j]--;
            if(i == 0 && j == 0)
                inc[A[i][j]]++;
            if(i > j)
                dec[A[i][j]]++;
            num[A[i][j]] += max(i, j);
        }
    }

    rep(j, N) res[j] = min(res[j], num[j]);

    for(int i = 1; i < N; i++) {
        rep(j, N) { num[j] += inc[j] - dec[j]; }
        rep(j, N) res[j] = min(res[j], num[j]);
        for(int j = i; j >= 0; j--) {
            inc[A[j][i - j]]++;
        }
        for(int j = i; j < N; j++) {
            dec[A[j][j - i]]--;
        }
    }
    ll ans = 0;
    rep(i, N) ans += res[i];
    cout << ans << endl;
}