#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) {
  return '"' + s + '"';
}
string to_string(const char* s) {
  return to_string((string) s);
}
string to_string(bool b) {
  return (b ? "true" : "false");
}
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
 
#define ll long long
const long long mod = 1e9+7; // CHECK
long long power(long long a, long long b, long long m = mod) {
    if(b < 0) {
        return power(power(a, -b), mod-2);
    }
    long long x = 1;
    while(b) {
        if(b & 1) {
            x = 1ll * x * a % m;
        }
        a = 1ll * a * a % m;
        b /= 2;
    }
    return x;
}
const int INT_INF = 1e9+9;
const ll LL_INF = 2e18;
const int N = 3e5+9;

signed main() {  
    ios_base::sync_with_stdio(false); 
    #ifndef LOCAL
    cin.tie(0); cout.tie(0);
    #endif
    int n; cin >> n;
    vector<int> order(n * n);
    vector<vector<int>> d(n, vector<int>(n));
    vector<vector<int>> occ(n, vector<int>(n));
    for(int i = 0; i < n * n; i++) {
        cin >> order[i];
        order[i]--;
    }
    for(int u = 0; u < n * n; u++) {
        int i = u / n, j = u % n;
        d[i][j] = min({i, j, n-j-1, n-i-1});
        occ[i][j] = 1;
    }
    const int dr[] = {1, 0, -1, 0};
    const int dc[] = {0, 1, 0, -1};
    ll ans = 0;
    for(int t = 0; t < n * n; t++) {
        int r = order[t] / n, c = order[t] % n;
        ans += d[r][c];
        occ[r][c] = 0;
        queue<pair<int, int>> q;
        q.push({r, c});
        while(!q.empty()) {
            r = q.front().first, c = q.front().second; q.pop();
            for(int dd = 0; dd < 4; dd++) {
                int nr = r + dr[dd], nc = c + dc[dd];
                if(nr >= 0 && nc >= 0 && nr < n && nc < n && d[nr][nc] > d[r][c] + occ[r][c]) {
                    d[nr][nc] = d[r][c] + occ[r][c];
                    q.push({nr, nc});
                }
            }
        }
    }

    cout << ans << '\n';
    
    






    return 0;
}



Measured memory_bytes: 6076