#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1 << 28;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	int N; scanf("%d", &N);
	vector<vector<int>> a(N, vector<int>(N)); for (int i = 0; i < N; i++) for (int j = 0; j < N; j++) scanf("%d", &a[i][j]), a[i][j]--;

	vector<vector<int>> H(N);
	vector<vector<int>> W(N);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			H[a[i][j]].push_back(i);
			W[a[i][j]].push_back(j);
		}
	}

	ll res = 0;

	for (int i = 0; i < N; i++) {
		ll tmp = INF;
		for (int j = 0; j < N; j++) {
			ll tmp2 = 0;
			for (int k = 0; k < N; k++) {
				tmp2 += max(abs(H[i][k] - j), W[i][k]);
			}
			chmin(tmp, tmp2);
		}
		res += tmp;
	}
	cout << res << endl;
    return 0;
}