#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 1234
#endif

int N,M,Q;
typedef pair<int, int> P;
vector<P> A[SIZE];

int count(int i, int pos) {
    int ret = 0;
    for (auto p:A[i]) {
        ret += max(abs(p.first-pos), abs(p.second));
    }
    return ret;
}

void solve() {
    cin>>N;
    int a;
    REP(i,N)REP(j,N) {
        cin>>a;
        A[--a].push_back(*new P(i,j));
    }
    int ans = 0;
    REP(i,N) {
        int l=0, r=N-1;
        REP(k,15) {
            int ll = (l*2+r)/3;
            int rr = (l+r*2)/3;
            if (count(i,ll) < count(i,rr)) r = rr;
            else l = ll;
        }
        int mi = LONG_LONG_MAX;
        FOR(j,l,r+1) {
            mi = min(mi, count(i,j));
        }
        ans += mi;
    }
    cout << ans << endl;
}