#define MOD_TYPE 2

#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using multiInt = boost::multiprecision::cpp_int;
using lld = boost::multiprecision::cpp_dec_float_100;
*/

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
template <typename Q_type>
using smaller_queue = priority_queue<Q_type, vector<Q_type>, greater<Q_type>>;

constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);
//constexpr ll MOD = 1;
constexpr int INF = (int)1e9;
constexpr ll LINF = (ll)4e18;
constexpr ld PI = acos(-1.0);
constexpr ld EPS = 1e-11;
constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};

#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)
#define repi(i, n) REPI(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"
#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"
#define possible(n) cout << ((n) ? "possible" : "impossible") << "\n"
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << "\n"
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << "\n"
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << "\n";

inline void init_main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(30) << setiosflags(ios::fixed);
}
template <typename T>
inline bool chmin(T &a, T b)
{
  if (a > b)
  {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
inline bool chmax(T &a, T b)
{
  if (a < b)
  {
    a = b;
    return true;
  }
  return false;
}
inline ll CEIL(ll a, ll b)
{
  return (a + b - 1) / b;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val)
{
  fill((T *)array, (T *)(array + N), val);
}
#pragma endregion

int main()
{
  init_main();

  ll n;
  cin >> n;
  vector<pll> v[1010];
  rep(i, n) rep(j, n)
  {
    ll a;
    cin >> a;
    a--;
    v[a].push_back(MP(i, j));
  }

  ll ans = 0;
  rep(qi, n)
  {
    ll U[1010] = {}, U2[1010] = {}, D[1010] = {}, D2[1010] = {}, S[1010] = {};
    for (auto [i, j] : v[qi])
    {
      S[max(0LL, i - j)] += j;
      S[min(n, i + j + 1)] -= j;
      if (i + j + 1 <= n)
      {
        U[i + j + 1] += j + 1;
        U2[i + j + 1]++;
      }
      if (i - j - 1 >= 0)
      {
        D[i - j - 1] += j + 1;
        D2[i - j - 1]++;
      }
    }

    rep(i, n) S[i + 1] += S[i];
    ll t = 0;
    REP(i, 1, n + 1)
    {
      U[i] += U[i - 1] + t;
      t += U2[i];
    }
    t = 0;
    for (int i = n - 1; i >= 0; i--)
    {
      D[i] += D[i + 1] + t;
      t += D2[i];
    }

    ll Min = LINF;
    rep(i, n)
    {
      chmin(Min, S[i] + U[i] + D[i]);
    }

    ans += Min;
  }
  cout << ans << "\n";
  return 0;
}