#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template<class T> using vc = vector<T>;
template<class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i,n) for (auto& i: n)

template<class T> inline bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void init() {cin.tie(0);ios::sync_with_stdio(false);cout << fixed << setprecision(15);}

#ifdef DEBUG
template <class T, class N> void verr(const T& a, const N& n) { rep(i, n) cout << a[i] << " "; cout << "\n" << flush; }
ll dbgt = 1; void err() { cout << "passed " << dbgt++ << "\n" << flush; }
template<class H, class... T> void err(H&& h,T&&... t){ cout<< h << (sizeof...(t)?" ":"\n") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }
#endif

const ll INF = 5e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
ll A[1000][1005], dist[1005];

int main() {
    init();
    ll N;
    cin >> N;
    rep(i, N) rep(j, N){
        ll a;
        cin >> a;
        a--;
        dist[a] += max(i, j);
        A[a][0]--, A[a][N]--;
        A[a][max(0ll, i - j)]++, A[a][min(N, i + j)]++;
    }

    rep(i, N) rep(j, N) A[i][j + 1] += A[i][j];

    ll ans = 0;
    rep(i,N){
        ll tmp = dist[i];
        rep(j,N){
            dist[i] += A[i][j];
            chmin(tmp, dist[i]);
        }
        ans += tmp;
    }

    cout << ans << endl;
}