#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <cassert>
#include <numeric>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
//const long long MOD = 1000000007;
const long long MOD = 998244353;

using namespace std;

int n;
vector<vector<int> > z;

int calc(int i, int j)
{
    vector<int>& v = z[i];

    int sum = 0;
    int k;
    for (k = 0; k < n; k++) {
        int x = v[k] / n;
        int y = v[k] % n;
        sum+=MAX(abs(x - j), y);
    }     

    return sum;
}

void solve()
{
    scanf("%d", &n);
    z.resize(n);
#define P(i, j) ((i)*n+(j))
    int i, j, k;
    for (i = 0; i < n; i++) {
        for (j = 0; j < n; j++) {
            int tmp;
            scanf("%d", &tmp); tmp--;
            z[tmp].push_back(P(i, j));
        }
    }
    ll ans = 0;
    for (i = 0; i < n; i++) {
        int ans0 = INF;
#if 1
        int l = 0, r = n;
        while (r - l > 5) {
            int delta = (r - l) / 3;
            int m0 = l + delta;
            int m1 = m0 + delta;
            int a0 = calc(i, m0);
            int a1 = calc(i, m1);
            ans0 = MIN(ans0, MIN(a0, a1));
            if (a0 < a1) {
                r = m1;
            }
            else {
                l = m0;
            }
        }
        for (k = l; k < r; k++) {
            int tmp = calc(i, k);
            ans0 = MIN(ans0,tmp);
        }

#else
        int j;
        for (j = 0; j < n; j++) {
            int sum = calc(i, j);
            ans0 = MIN(ans0, sum);
        }
#endif
        ans += ans0;
    }
    printf("%lld\n", ans);

    return;
}

int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T;
    scanf("%d", &T);
    int t;
    for(t=0; t<T; t++) {
        //printf("Case #%d: ", t+1);
        solve();
    }
#endif
    return 0;
}