#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
const int inf=1e9+7;
const ll mod=1e9+7;

int main() {
    int N;
    cin>>N;
    vector<vector<pair<int, int> > >arr(N);
    int tmp;
    for(int i=0;i<N;++i){
        for(int j=0;j<N;++j){
            cin>>tmp;
            tmp--;
            arr[tmp].push_back(make_pair(i, j));
        }
    }
    vector<int> xarr;
    vector<int> x1;
    for(int i=0;i<N;++i){
        xarr.clear();
        for(int j=0;j<N;++j){
            xarr.push_back(arr[i][j].fi);
        }
        sort(xarr.begin(), xarr.end());
        x1.push_back(xarr[N/2]);
    }
    int x, y;
    for(int i=0;i<N;++i){
        for(int j=0;j<N;++j){
            x = arr[i][j].fi;
            y = arr[i][j].se;
            arr[i][j] = make_pair(abs(x-x1[i]), abs(y));
        }
    }
    int ans = 0;
    for(int i=0;i<N;++i){
        for(int j=0;j<N;++j){
            ans += max(arr[i][j].fi, arr[i][j].se);
        }
    }
    cout<<ans-1<<endl;
}