#include <bits/stdc++.h>
#include <unistd.h>

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
//const ll MOD = 1000000007;
const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'


int main() {
  int n;
  cin >> n;
  vii a(n, vi(n));
  rep (i, n) {
    rep (j, n) {
      if (i == j) continue;
      cin >> a[i][j];
    }
  }

  vll rem_cost1(n, vl(n));
  rep (i, n) {
    for (int j = i + 1; j < n; j++) {
      rem_cost1[i][j] = rem_cost1[i][j - 1];
      for (int k = i; k < j; k++) {
        rem_cost1[i][j] += a[k][j];
      }
    }
  }

  vll rem_cost2(n, vl(n));
  rep (i, n) {
    for (int j = i + 1; j < n; j++) {
      rem_cost2[i][j] = rem_cost2[i][j - 1];
      for (int k = i; k >= 0; k--) {
        rem_cost2[i][j] += a[j][k];
      }
    }
  }

  vll dp(n, vl(n, INF));
  for (int i = 1; i < n; i++) {
    for (int j = 0; j < i; j++) {
      dp[i][j] = rem_cost1[0][j] + rem_cost1[j + 1][i];
    }
  }

  rep (i, n) {
    rep (j, n) {
      if (dp[i][j] >= INF / 2) continue;
      for (int k = i + 1; k < n; k++) {
        ll add = 0;
        add += rem_cost1[i + 1][k];
        add += (rem_cost2[j][k] - rem_cost2[j][i]);
        dp[k][i] = min(dp[k][i], dp[i][j] + add);
      }
    }
  }

  /*
  DEBUG_MAT(a);
  DEBUG_MAT(rem_cost1);
  DEBUG_MAT(rem_cost2);
  DEBUG_MAT(dp);
  //*/

  ll ans = INF;
  rep (j, n) {
    ans = min(ans, dp[n - 1][j]);
  }
  cout << ans << endl;
}


Measured memory_bytes: 9216