#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <complex>
using namespace std;

typedef long long ll;
typedef uint64_t ull;
typedef pair<int, int> P;
constexpr double PI = 3.1415926535897932;   // acos(-1)
constexpr double EPS = 1e-9;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define chadd(x, y) x = (x + y) % mod

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<vector<P>> pos(n);
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < n; ++j){
            int foo;
            cin >> foo;
            --foo;
            pos[foo].push_back(P(i, j));
        }
    }

    vector<int> mine(n, INF);
    for(int st = 0; st < n; ++st){
        for(int i = 0; i < n; ++i){
            int sum = 0;
            for(int j = 0; j < n; ++j){
                sum += max(abs(pos[i][j].first - st), pos[i][j].second);
            }
            chmin(mine[i], sum);
        }    
    }

    ll ans = 0;
    for(int i = 0; i < n; ++i)  ans += mine[i];
    cout << ans << endl;
}