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>
#define LL long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
using namespace std;
inline int read(){
	int v=0,f=1;
	char c=getchar();
	while (c<'0' || c>'9'){
		if (c=='-') f=-1;
		c=getchar();
	}
	while (c>='0' && c<='9'){
		v=v*10+c-'0';
		c=getchar();
	}
	return v*f;
}
const int Maxn=505;
int n,a[Maxn][Maxn];
LL dp[Maxn][Maxn];
LL S1[Maxn][Maxn],S2[Maxn][Maxn];
LL Q1(int x1,int x2,int y1,int y2){
	if (x1>x2 ||y1>y2) return 0;
	return S1[x2][y2]-S1[x1-1][y2]-S1[x2][y1-1]+S1[x1-1][y1-1];
}
LL Q2(int x1,int x2,int y1,int y2){
	if (x1>x2 || y1>y2) return 0;
	return S2[x2][y2]-S2[x1-1][y2]-S2[x2][y1-1]+S2[x1-1][y1-1];
}
int main(){
	scanf("%d",&n);
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			if (i==j) continue;
			scanf("%d",&a[i][j]);
			if (i<j){
				S1[i][j]=a[i][j];
			}
			else{
				S2[i][j]=a[i][j];
			}
		}
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			S1[i][j]+=S1[i-1][j]+S1[i][j-1]-S1[i-1][j-1]; 
			S2[i][j]+=S2[i-1][j]+S2[i][j-1]-S2[i-1][j-1]; 
		}
	}
	for (int i=0;i<Maxn;i++){
		for (int j=0;j<Maxn;j++){
			dp[i][j]=1e18;
		}
	}
	LL ans=1e18;
	for (int i=1;i<=n;i++){
		dp[i][0]=Q1(1,i,1,i);
	}
	//cout<<S1[3][3]<<' '<<S2[3][3]<<endl;
	//cout<<Q1(1,3,1,3)<<" "<<Q2(1,3,1,3)<<endl;
	for (int i=2;i<=n;i++){
		for (int j=1;j<i;j++){
			for (int k=0;k<j;k++){
				if (dp[j][k]==1e18) continue;
				dp[i][j]=min(dp[i][j],dp[j][k]+Q1(j+1,i,j+1,i)+Q2(j+1,i,1,k));
			}
		//	cout<<i<<' '<<j<<' '<<dp[i][j]<<endl;
		}
	}
	ans=Q1(1,n,1,n);
	for (int i=1;i<=n;i++){
		for (int j=0;j<i;j++){
			ans=min(ans,dp[i][j]+Q1(i+1,n,i+1,n)+Q2(i+1,n,1,j));
		}
	}
	printf("%lld\n",ans);
	return 0;
}