We have a weighted directed graph with N vertices numbered 0 to N-1.

The graph initially has N-1 edges. The i-th edge (0 \leq i \leq N-2) is directed from Vertex i to Vertex i+1 and has a weight of 0.

Snuke will now add a new edge (i → j) for every pair i, j (0 \leq i,j \leq N-1,\ i \neq j). The weight of the edge will be -1 if i < j, and 1 otherwise.

Ringo is a boy. A negative cycle (a cycle whose total weight is negative) in a graph makes him sad. He will delete some of the edges added by Snuke so that the graph will no longer contain a negative cycle. The cost of deleting the edge (i → j) is A_{i,j}. He cannot delete edges that have been present from the beginning.

Find the minimum total cost required to achieve Ringo's objective.

Constraints

* 3 \leq N \leq 500
* 1 \leq A_{i,j} \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_{0,1} A_{0,2} A_{0,3} \cdots A_{0,N-1}
A_{1,0} A_{1,2} A_{1,3} \cdots A_{1,N-1}
A_{2,0} A_{2,1} A_{2,3} \cdots A_{2,N-1}
\vdots
A_{N-1,0} A_{N-1,1} A_{N-1,2} \cdots A_{N-1,N-2}


Output

Print the minimum total cost required to achieve Ringo's objective.

Examples

Input

3
2 1
1 4
3 3


Output

2


Input

4
1 1 1
1 1 1
1 1 1
1 1 1


Output

2


Input

10
190587 2038070 142162180 88207341 215145790 38 2 5 20
32047998 21426 4177178 52 734621629 2596 102224223 5 1864
41 481241221 1518272 51 772 146 8805349 3243297 449
918151 126080576 5186563 46354 6646 491776 5750138 2897 161
3656 7551068 2919714 43035419 495 3408 26 3317 2698
455357 3 12 1857 5459 7870 4123856 2402 258
3 25700 16191 102120 971821039 52375 40449 20548149 16186673
2 16 130300357 18 6574485 29175 179 1693 2681
99 833 131 2 414045824 57357 56 302669472 95
8408 7 1266941 60620177 129747 41382505 38966 187 5151064


Output

2280211
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcountll

#define INF 1e16
#define mod 1000000007

ll N;
ll A[510][510];
ll lpsum[510][510];
ll psum[510][510],nsum[510][510];
ll dp[510][510];

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  cin>>N;
  ll tot=0;
  rep(i,N){
    rep(j,N){
      if(i==j)continue;
      cin>>A[i][j];
      tot+=A[i][j];
    }
  }

  rep(i,N){
    repl(j,i+1,N){
      lpsum[i][j]=lpsum[i][j-1]+A[j][i];
    }
    for(ll j=i-1;j>=0;j--){
      psum[j][i]=psum[j+1][i]+A[i][j];
    }
    for(ll j=i-1;j>=0;j--){
      nsum[j][i]=nsum[j+1][i]+A[j][i];
    }
  }

  ll res=0;
  rep(i,N)rep(j,N)dp[i][j]=-INF;
  repl(i,1,N){
    dp[i][0]=psum[0][i]+nsum[0][i];
    for(ll j=i-1;j>=0;j--){
      dp[i][0]+=psum[0][j];
    }

    ll crt=dp[i][0];
    repl(k,i+1,N){
      crt+=nsum[0][k]-nsum[i][k];
      crt+=psum[0][k];
    }
    maxch(res,crt);
  }

  repl(i,1,N)repl(j,1,i){
    ll vp=psum[j][i];
    for(ll k=i-1;k>=j;k--){
      vp+=lpsum[k][i-1];
    }
    ll vn=nsum[0][i];
    for(ll k=i-1;k>j;k--){
      vn+=nsum[0][k]-nsum[j][k];
    }
    for(ll k=j-1;k>=0;k--){
      vp+=lpsum[k][i-1]-lpsum[k][j];
      maxch(dp[i][j],dp[j][k]+vp+vn);
    }

    ll crt=dp[i][j];
    repl(k,i+1,N){
      crt+=nsum[0][k]-nsum[i][k];
      crt+=psum[j][k];
    }
    maxch(res,crt);
  }

  cout<<tot-res<<endl;

  return 0;
}
