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
/****************************************************************
*	Author: huhao
*	Email: 826538400@qq.com
*	Create time: 2020-03-25 15:20:24
****************************************************************/
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#define fr(i,a,b) for(int i=(a),end_##i=(b);i<=end_##i;i++)
#define fd(i,a,b) for(int i=(a),end_##i=(b);i>=end_##i;i--)
int read()
{
	int r=0,t=1,c=getchar();
	while(c<'0'||c>'9')
	{
		t=c=='-'?-1:1;
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		r=(r<<3)+(r<<1)+(c^48);
		c=getchar();
	}
	return r*t;
}
#define i64 long long
const int N=510;
const i64 inf=1ll<<50;
i64 n,a[N][N],f[N][N],ans,s[N][N],S[N][N];
int main()
{
	n=read(); ans=inf;
	fr(i,1,n) fr(j,1,n) if(i!=j) a[i][j]=read();
	fr(i,1,n) fr(j,1,n)
	{
		s[i][j]=s[i-1][j]+s[i][j-1]+a[i][j]-s[i-1][j-1];
		S[i][j]=S[i-1][j]+S[i][j-1]+(i>=j?0:a[i][j])-S[i-1][j-1];
	}
	fr(i,0,n+1) fr(j,0,n+1) f[i][j]=inf;
	f[0][0]=0;
	fr(j,0,n) fr(i,0,j) if(f[i][j]!=inf)
		fr(k,j+1,n+1)
		{
			i64 F=f[i][j];
			F+=S[k?k-1:0][k?k-1:0]-S[k?k-1:0][j?j-1:0]-S[j?j-1:0][k?k-1:0]+S[j?j-1:0][j?j-1:0];
			//fr(I,1,n) if(I>=j&&I<k) fr(J,1,n) if(J>=j&&J<k&&I<J) F+=a[I][J];
			F+=s[n][j?j-1:0]-s[n][i?i-1:0]-s[k?k-1:0][j?j-1:0]+s[k?k-1:0][i?i-1:0];
			//fr(I,1,n) if(I>=i&&I<j) fr(J,1,n) if(J>=k) F+=a[J][I];
			f[j][k]=std::min(f[j][k],F);
		}
		/*
		(-)	000001111222223333
		         i   j    k
		*/
	fr(i,0,n) ans=std::min(ans,f[i][n+1]);
	printf("%lld\n",ans);
	return 0;
}