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 long double ld;
#define mp make_pair
#define PI pair<int,int>
#define poly vector<ll>
#define For(i,l,r) for(int i=(int)(l);i<=(int)(r);i++)
#define Rep(i,r,l) for(int i=(int)(r);i>=(int)(l);i--)
#define pb push_back
#define fi first
#define se second
inline char gc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
#define gc getchar
inline ll read(){
	ll x = 0; char ch = gc(); bool positive = 1;
	for (; !isdigit(ch); ch = gc())	if (ch == '-')	positive = 0;
	for (; isdigit(ch); ch = gc())	x = x * 10 + ch - '0';
	return positive ? x : -x;
}
inline void write(ll a){
    if(a<0){
    	a=-a; putchar('-');
	}
    if(a>=10)write(a/10);
    putchar('0'+a%10);
}
inline void writeln(ll a){write(a); puts("");}
inline void wri(ll a){write(a); putchar(' ');}
inline ull rnd(){
	return ((ull)rand()<<30^rand())<<4|rand()%4;
}
const int N=505;
ll f[N][N],g[N][N],dp[N][N];
ll gf(int a,int b,int c,int d){//<=1,i>j
	return f[b][d]+f[a][c]-f[a][d]-f[b][c];
}
ll gg(int a,int b,int c,int d){//>=1,i<j
	return g[b][d]+g[a][c]-g[a][d]-g[b][c];
}
int main(){
	int n=read();
	For(i,1,n){
		For(j,1,n){
			int x=0;
			if(i!=j)x=read();
			f[i][j]=f[i-1][j]+f[i][j-1]-f[i-1][j-1];
			g[i][j]=g[i-1][j]+g[i][j-1]-g[i-1][j-1];
			if(i>j)f[i][j]+=x; else g[i][j]+=x;
		}
	}
	ll ans=gg(0,n,0,n);
	For(i,1,n-1)ans=min(ans,gg(0,i,0,i)+gg(i,n,i,n));
	ans-=gf(0,n,0,n);
	For(i,1,n-1){
		For(j,i+1,n-1){
			dp[i][j]=-gf(0,j,0,j)+gg(0,i,0,i)+gg(i,j,i,j);
			ll zs=-gf(i,j,i,j)+gg(i,j,i,j); dp[i][j]-=zs;
			For(k,1,i-1)dp[i][j]=min(dp[i][j],dp[k][i]-gf(i,j,k,i)); 
			dp[i][j]+=zs;
			ans=min(ans,dp[i][j]-gf(j,n,i,n)+gg(j,n,j,n));
		}
	}
	cout<<ans+gf(0,n,0,n)<<endl;
}