#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;

void bfs(int s, const int& n, const vector<vector<int>>& a, vector<vector<int>>& dist) {
    q.emplace(s,0,0);

    vector<vector<bool>> visited(n, vector<bool> (n,false));
    while(!q.empty()) {
        auto [y,x,c] = q.front(); q.pop();
        if (visited[y][x]) continue;
        visited[y][x] = true;
        dist[s][a[y][x]-1] += c;
        for (int i=0; i<5; i++) {
            int xi = x + dx[i];
            int yi = y + dy[i];
            if (xi<0 || n<=xi) continue;
            if (yi<0 || n<=yi) continue;
            if (visited[yi][xi]) continue;
            q.emplace(yi, xi, c+1);
        }
    }
}

int main() {
    int n;
    cin >> n;
    vector<vector<int>> a(n,vector<int>(n,0));
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            scanf("%d",&a[i][j]);
        }
    }

    vector<vector<int>> dist(n, vector<int>(n, 0));
    for (int i=0; i<n; i++) {
        bfs(i,n,a,dist);
    }

    vector<int> ans(n, INT_MAX);
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            ans[i] = min(ans[i], dist[j][i]);
        }
    }


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