#include <bits/stdc++.h>
#define all(vec) vec.begin(), vec.end()
#define pb push_back
#define eb emplace_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T>
using V = vector<T>;
constexpr ll INF = (1LL << 30) - 1LL;
constexpr ll MOD = 998244353LL;
constexpr int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
template <class T>
void chmin(T &a, T b) { a = min(a, b); }
template <class T>
void chmax(T &a, T b) { a = max(a, b); }
void debug() { cerr << "ok" << endl; }
template <class T>
void printv(const vector<T> &v) {
    for (int i = 0; i < v.size(); i++) cout << v[i] << (i + 1 == v.size() ? '\n' : ' ');
}
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    V<V<P>> a(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            int aa;
            cin >> aa;
            --aa;
            a[aa].eb(i, j);
        }
    }
    ll res = 0;
    for (int i = 0; i < n; i++) {
        auto calc = [&](int x) {
            ll sum = 0;
            for (auto &e : a[i]) {
                sum += max(abs(e.first - x), e.second);
            }
            return sum;
        };
        //整数値での三分探索
        auto TernarySearch = [&](auto lb, auto ub) { //[lb,ub]
            using T = decltype(lb);
            T ok = lb - 1, ng = ub;
            while (ng - ok > 1) {
                T mid = (ok + ng) / 2;
                if (calc(mid + 1) - calc(mid) < 0) { //下に凸なら<
                    ok = mid;
                } else {
                    ng = mid;
                }
            }
            return ng;
        };
        res += calc(TernarySearch(0, n - 1));
    }
    cout << res << '\n';
}