// #pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <list>
 
// hloya template v25
  
// ░░░░░░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░░░░░
// ░░░░░░█░░▄▀▀▀▀▀▀▀▀▀▀▀▀▀▄░░█░░░░░
// ░░░░░░█░█░▀░░░░░▀░░▀░░░░█░█░░░░░
// ░░░░░░█░█░░░░░░░░▄▀▀▄░▀░█░█▄▀▀▄░
// █▀▀█▄░█░█░░▀░░░░░█░░░▀▄▄█▄▀░░░█░
// ▀▄▄░▀██░█▄░▀░░░▄▄▀░░░░░░░░░░░░▀▄
// ░░▀█▄▄█░█░░░░▄░░█░░░▄█░░░▄░▄█░░█
// ░░░░░▀█░▀▄▀░░░░░█░██░▄░░▄░░▄░███
// ░░░░░▄█▄░░▀▀▀▀▀▀▀▀▄░░▀▀▀▀▀▀▀░▄▀░
// ░░░░█░░▄█▀█▀▀█▀▀▀▀▀▀█▀▀█▀█▀▀█░░░
// ░░░░▀▀▀▀░░▀▀▀░░░░░░░░▀▀▀░░▀▀░░░░
  
#include <bits/stdc++.h>
#include <valarray>
using namespace std;
  
bool dbg = 0;
  
clock_t start_time = clock();
#define current_time fixed<<setprecision(6)<<(ld)(clock()-start_time)/CLOCKS_PER_SEC
  
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
  
#define ll long long
#define ld long double
#define pii pair<int,int>
#define umap unordered_map<int, int>
  
#define files1 freopen("input.txt","r",stdin)
#define files2 freopen("output.txt","w",stdout)
#define files files1;files2
#define fast_io ios_base::sync_with_stdio(0);cin.tie(0)
  
// #define endl '\n'
#define ln(i,n) " \n"[(i) == (n) - 1]
  
void bad(string mes = "Impossible"){cout << mes;exit(0);}
void bad(int mes){cout << mes;exit(0);}
  
template<typename T>
string bin(T x, int st = 2){
    string ans = "";
    while (x > 0){
        ans += char('0' + x % st);
        x /= st;
    }
    reverse(ans.begin(), ans.end());
    return ans.empty() ? "0" : ans;
}
  
template<typename T>
void upmax(T& x, T y) {
    x = max(x, y);
}
  
template<typename T>
void upmin(T& x, T y) {
    x = min(x, y);
}
 
// inline int popcount(int x){
//     int count = 0;
//     __asm__ volatile("POPCNT %1, %0;":"=r"(count):"r"(x):);
//     return count;
// }
  
template<typename T>
T input(){
    T ans = 0, m = 1;
    char c = ' ';
  
    while (!((c >= '0' && c <= '9') || c == '-')) {
        c = getchar();
    }
  
    if (c == '-')
        m = -1, c = getchar();
    while (c >= '0' && c <= '9'){
        ans = ans * 10 + (c - '0'), c = getchar();
    }
    return ans * m;
}
  
template<typename T> void read(T& a) { a = input<T>(); }
template<typename T> void read(T& a, T& b) { read(a), read(b); }
template<typename T> void read(T& a, T& b, T& c) { read(a, b), read(c); }
template<typename T> void read(T& a, T& b, T& c, T& d) { read(a, b), read(c, d); }
  
const int inf = 1e9 + 20;
const short short_inf = 3e4 + 20;
const long double eps = 1e-6;
const int maxn = (int)3e5 + 12;//, base = 1e9 + 7;
const ll llinf = 2e18 + 5;
const double PI = acos(-1.0);
 
const int mod = 1e9 + 7;
  
template<typename T>
T binpow(T n, T s)
{
    if (s <= 0)
        return 1LL;
    if (s % 2 == 0){
        T b = binpow(n, s / 2);
        return ( 1LL * b * b ) % mod;
    } else {
        return (1LL* binpow(n, s - 1) * n) % mod;
    }
}

ll dp[505][505];
ll a[505][505];
ll p[505][505], p2[505][505];

ll sum(int x1, int x2, int y1, int y2) {
    assert(x1 <= x2 && y1 <= y2);
    return p[x2][y2] - (x1 ? p[x1 - 1][y2] : 0) - (y1 ? p[x2][y1 - 1] : 0) +
        ((x1&&y1) ? p[x1 - 1][y1 - 1] : 0);
}

ll sum2(int x1, int x2, int y1, int y2) {
    assert(x1 <= x2 && y1 <= y2);
    return p2[x2][y2] - (x1 ? p2[x1 - 1][y2] : 0) - (y1 ? p2[x2][y1 - 1] : 0) +
        ((x1&&y1) ? p2[x1 - 1][y1 - 1] : 0);
}

int main() {
    // files1;
    fast_io;

    int n;
    cin >> n;

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            cin >> a[i][j];
        }
    memset(dp, -1, sizeof(dp));

    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++) {
            p[i][j] = (i < j ? a[i][j] : 0);
            if (i)
                p[i][j] += p[i - 1][j];
            if (j)
                p[i][j] += p[i][j - 1];
            if (i && j)
                p[i][j] -= p[i - 1][j - 1];

            p2[i][j] = (i > j ? a[i][j] : 0);
            if (i)
                p2[i][j] += p2[i - 1][j];
            if (j)
                p2[i][j] += p2[i][j - 1];
            if (i && j)
                p2[i][j] -= p2[i - 1][j - 1];
        }

    ll ans = 0;

    for (int i = 0; i + 1 < n; i++) {
        ans = max(ans, sum(0, i, i + 1, n - 1) + sum2(0, n - 1, 0, n - 1));
    }

    for (int i = 0; i + 1 < n; i++)
        for (int j = i + 1; j + 1 < n; j++) {
            dp[i][j] = max(dp[i][j], sum(0, i, i + 1, n - 1) + sum(i + 1, j, j + 1, n - 1) + 
                        sum2(0, j, 0, j));

            ans = max(ans, dp[i][j] + sum2(i + 1, n - 1, i + 1, n - 1) -
                sum2(i + 1, j, i + 1, j));

            for (int k = j + 1; k + 1 < n; k++) {
                dp[j][k] = max(dp[j][k],
                    dp[i][j] + sum(j + 1, k, k + 1, n - 1) + 
                    sum2(i + 1, k, i + 1, k) - sum2(i + 1, j, i + 1, j));
            }
        }
    ll sum = p[n-1][n-1] + p2[n-1][n-1];
    cout << sum - ans;
    return 0;
}


Measured memory_bytes: 8192