#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
    cin>>n;
    vector<P> v[1010];
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            int a; cin>>a;
            v[a-1].push_back({i, j});
        }
    }
    ll ans=0;
    for(int i=0; i<n; i++){
        vector<ll> s(n+1), s2(n+1);
        ll s0=0;
        for(auto p:v[i]){
            int x=p.first, y=p.second;
            s0+=y;
            if(x+y>=n) continue;
            s[x+y+1]++;
        }
        for(int j=0; j<n; j++) s[j+1]+=s[j];
        for(int j=0; j<n; j++) s[j+1]+=s[j];
        for(auto p:v[i]){
            int x=p.first, y=p.second;
            if(x-y<=0) continue;
            s2[x-y-1]++;
        }
        for(int j=n; j>=1; j--) s2[j-1]+=s2[j];
        for(int j=n; j>=1; j--) s2[j-1]+=s2[j];
        ll mn=1e18;
        for(int j=0; j<n; j++){
            mn=min(mn, s[j]+s2[j]);
        }
        ans+=mn+s0;
    }
    cout<<ans<<endl;
	return 0;
}