#include <iostream>
#include <vector>
#include <queue>
#include <numeric>
#include <tuple>
#include <climits>

using namespace std;
using P = pair<int,int>;
using TP = tuple<int,int,int>;

const vector dx = {+0,+1,+1,+0,+1};
const vector dy = {+1,+1,+0,-1,-1};

queue<TP> q;

int main() {
    int n;
    cin >> n;

    vector<vector<P>> a(n);
    for (int i=0; i<n; i++) {
       for (int j=0; j<n; j++) {
           int ai;
           cin >> ai;
           a[ai-1].emplace_back(i,j);
       }
    }


    vector<int> ans(n, INT_MAX);
    for (int i=0; i<n; i++) {
        vector<int> tmp(n, 0);
        for (int j=0; j<n; j++) {
            for (auto [y,x] : a[j]) {
                tmp[j] += max(x, abs(y-i));
            }
        }
        for (int j=0; j<n; j++) ans[j] = min(ans[j], tmp[j]);
    }

    cout << accumulate(ans.begin(), ans.end(), 0) << endl;
}