#include <stdio.h>

constexpr unsigned int MAX_N = 1000;
unsigned int A[MAX_N][MAX_N];
unsigned long long int P[MAX_N][MAX_N];
unsigned long long int Q[MAX_N][MAX_N];
unsigned long long int S[MAX_N];

int main(void){
    unsigned int n; scanf("%u", &n);
    for(unsigned int i = 0; i < n; ++i) for(unsigned int j = 0; j < n; ++j){ scanf("%u", A[i] + j); --A[i][j]; }
    for(unsigned int i = 0; i < n; ++i) for(unsigned int j = 0; j < n; ++j){
        S[A[i][j]] += j;
        if(i + j + 1 < n) ++P[A[i][j]][i + j + 1];
        if(i >= (j + 1)) ++Q[A[i][j]][i - (j + 1)];
    }
    for(unsigned int i = 0; i < n; ++i){
        for(unsigned int j = 0; j + 1 < n; ++j) P[i][j + 1] += P[i][j];
        for(unsigned int j = 0; j + 1 < n; ++j) P[i][j + 1] += P[i][j];
    }
    for(unsigned int i = 0; i < n; ++i){
        for(unsigned int j = n - 1; j ; --j) Q[i][j - 1] += Q[i][j];
        for(unsigned int j = n - 1; j ; --j) Q[i][j - 1] += Q[i][j];
    }
    unsigned long long int res = 0;
    for(unsigned int i = 0; i < n; ++i){
        unsigned long long int s = P[i][0] + Q[i][0];
        for(unsigned int j = 1; j < n; ++j){
            const unsigned long long int&& tmp = P[i][j] + Q[i][j];
            if(tmp < s) s = tmp;
        }
        res += S[i] + s;
    }
    printf("%llu\n", res);
    return 0;
}