#define _GLIBCXX_DEBUG//TLEの原因になるので注意！！！！！！！！！！！
#include<cmath>
#include <bits/stdc++.h>
using ll = long long;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int,int> > qu2;
priority_queue<int> pq;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define rep2(i,n) for(int i=1; i<=(int)(n); i++)
#define mins(x,y) x=min(x,y)
#define maxs(x,y) x=max(x,y)
typedef set<int> set_t;
typedef set<string> set_g;
typedef complex<double> xy_t;
static const int NIL = -1;
static const int INF = 1000000007;
#define mp make_pair
#define sz(x) int(x.sise())
#define mod 1000000007
#define reps(i,s,n) for(int i = s; i < n; i++)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
deque<int> deq;
#define fi first
#define se second
//#define int long long

//cerrはコメントアウトしなくても通る//ただしTLEを引き起こすことがある

//const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
//const ll INF = 1LL << 60;
//typedef pair<ll,ll> P;
typedef pair<int, int> P;
bool chmx(int &a, int b) {
	if (b > a) {
		a = b;
		return true;
	}
	return false;
}

bool chmn(int &a, int b) {
	if (b < a) {
		a = b;
		return true;
	}
	return false;
}

vector<pair<int,int>> A[1005];

int main(){
    int n;
    cin >> n;
    int a[n][n];
    rep(i,n){
        rep(j,n){
            cin >> a[i][j];
            a[i][j]--;
            A[a[i][j]].push_back(mp(i,j));
        }
    }
    ll ans=0;
    rep(k,n){//社員kについて
        int tt=INF;
        rep(i,n){//点（i,0)より出撃
            int temp=0;
            rep(j,n){//爆撃地点
                int x,y;
                tie(x,y)=A[k][j];
                temp+=max(abs(x-i),y);
            }
            //if(temp<tt) cerr<<i;
            tt=min(tt,temp);
        }
        //cerr<<endl;
        ans+=tt;
    }
    cout<<ans<<endl;
    return 0;
}