import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

immutable long MOD = 10^^9 + 7;

void main() {
    auto N = readln.chomp.to!int;
    auto A = iota(N).map!(_ => readln.split.map!(x => x.to!int-1).array).array;

    auto B = new Tuple!(int, int)[][](N);
    foreach (i; 0..N) foreach (j; 0..N) B[A[i][j]] ~= tuple(i, j);

    auto C = new Tuple!(int, int)[](N);
    auto cnt = new int[](N);
    int sm = 0;
    int tmp = 0;

    foreach (i; 0..N) {
        cnt[] = 0;
        sm = 0;
        tmp = 0;
        foreach (b; B[i]) {
            cnt[b[0]] += N - 1 - b[1];
            sm += N - 1 - b[1];
        }
        foreach (k; 0..N) {
            tmp += cnt[k];
            if (tmp >= sm/2) {
                C[i] = tuple(k, i);
                break;
            }
        }
    }

    long ans = 0;

    foreach (i; 0..N) {
        auto idx = C[i][1];
        auto row = C[i][0];
        foreach (s; B[idx]) {
            ans += max(abs(row - s[0]), s[1]);
        }
    }

    ans.writeln;
}