#include #define REP(i, m, n) for(int i = (int)(m); i < (int)(n); ++i) #define rep(i, n) REP(i, 0, n) using namespace std; using ll = long long; using ld = long double; template inline bool chmax(T &a, const U &b) { if(a < b) { a = b; return true; } return false; } template inline bool chmin(T &a, const U &b) { if(a > b) { a = b; return true; } return false; } using pint = pair; int n, a[1000][1000]; int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n; vector> pos(n); rep(i, n) rep(j, n) cin >> a[i][j], a[i][j]--; rep(i, n) { rep(j, n) { pos[a[i][j]].push_back({i, j}); } } vector> s(n, vector(n+1, 0)); ll ans = 0; rep(i, n) { rep(j, n) { int l = max(0, pos[i][j].first-pos[i][j].second); int r = min(n-1, pos[i][j].first+pos[i][j].second); s[i][l]++; s[i][r+1]--; } rep(j, n+1) { if(j-1 < 0) continue; s[i][j] += s[i][j-1]; } int mx = -1, p = -1; rep(j, n) { if(chmax(mx, s[i][j])) { p = j; } } ll d = 0; rep(j, n) { d += pos[i][j].second+max(0, abs(pos[i][j].first-p)-pos[i][j].second); } ans += d; } cout << ans << '\n'; return 0; }