// >>> TEMPLATES #include using namespace std; using ll = long long; using ld = long double; using i32 = int32_t; using i64 = int64_t; #define int ll #define double ld #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define rep1(i,n) for (int i = 1; i <= (int)(n); i++) #define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--) #define rep1R(i,n) for (int i = (int)(n); i >= 1; i--) #define loop(i,a,B) for (int i = a; i B; i++) #define loopR(i,a,B) for (int i = a; i B; i--) #define all(x) (x).begin(), (x).end() #define allR(x) (x).rbegin(), (x).rend() #define pb push_back #define eb emplace_back #define mp make_pair #define fst first #define snd second auto constexpr INF32 = numeric_limits::max()/2-1; auto constexpr INF64 = numeric_limits::max()/2-1; auto constexpr INF = numeric_limits::max()/2-1; #ifdef LOCAL #include "debug.hpp" #define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__) #define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl #define debug if (1) #else #define dump(...) (void)(0) #define say(x) (void)(0) #define debug if (0) #endif template using pque_max = priority_queue; template using pque_min = priority_queue, greater >; template ::value>::type> ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; } template ::value>::type> istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; } template istream& operator>>(istream& is, pair& p) { return is >> p.first >> p.second; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup; template struct FixPoint : private F { constexpr FixPoint(F&& f) : F(forward(f)) {} template constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward(x)...); } }; struct MakeFixPoint { template constexpr auto operator|(F&& f) const { return FixPoint(forward(f)); } }; #define MFP MakeFixPoint()| #define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__) template struct vec_impl { using type = vector::type>; template static type make_v(size_t n, U&&... x) { return type(n, vec_impl::make_v(forward(x)...)); } }; template struct vec_impl { using type = T; static type make_v(T const& x = {}) { return x; } }; template using vec = typename vec_impl::type; template auto make_v(Args&&... args) { return vec_impl::make_v(forward(args)...); } template void quit(T const& x) { cout << x << endl; exit(0); } template constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; } template constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; } template constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits::value_type{}); } template int sz(T const& x) { return x.size(); } template int lbd(C const& v, T const& x) { return lower_bound(v.begin(), v.end(), x)-v.begin(); } template int ubd(C const& v, T const& x) { return upper_bound(v.begin(), v.end(), x)-v.begin(); } template int ppt(C const& v, F f) { return partition_point(v.begin(), v.end(), f)-v.begin(); } // <<< struct dat { int cnt = 0, sumX = 0, sumY = 0; void add(int x, int y) { ++cnt, sumX += x, sumY += y; } void del(int x, int y) { --cnt, sumX -= x, sumY -= y; } }; int32_t main() { int n; cin >> n; auto a = make_v(n,n); cin >> a; vector>> pos(n); rep (i,n) rep (j,n) pos[--a[i][j]].eb(i,j); int sum = 0; rep (i,n) { dat A,B,C; auto output = [&]() { dump(A.cnt,A.sumX,A.sumY); dump(B.cnt,B.sumX,B.sumY); dump(C.cnt,C.sumX,C.sumY); }; vector>> v(n); for (auto [x,y] : pos[i]) { if (x >= y) A.add(x,y); else B.add(x,y); int xx = x-y; if (0 <= xx && xx < n) v[xx].eb(true,x,y); xx = x+y; if (0 <= xx && xx < n) v[xx].eb(false,x,y); } output(); int mi = INF; rep (xx,n) { int val = A.sumX-xx*A.cnt + B.sumY + xx*C.cnt-C.sumX; dump(i,xx,val); chmin(mi,val); for (auto [type,x,y] : v[xx]) { if (type) { A.del(x,y); B.add(x,y); } else { B.del(x,y); C.add(x,y); } } output(); } dump(i,mi); say(""); sum += mi; } cout << sum << endl; }