#include<cstdio>
#include<vector>
#include<queue>

#define minim(a,b) ((a)<=(b)?(a):(b))
#define InFile "cc.in"
#define OutFile "cc.out"
#define pb push_back
#define mkp make_pair

using namespace std;

const int MaxN = 205;
const int INF = 0x3f3f3f3f;

int n,S,D,C[MaxN][MaxN],F[MaxN][MaxN],T[MaxN],inQ[MaxN],d[MaxN];
vector< pair<int,int> > G[MaxN];
queue<int> Q;

void Read()
{
	freopen( InFile , "r" , stdin );
	scanf("%d" , &n );
	S = (n << 1) + 1;
	D = S + 1;
	int i,j,x;
	for( i = 1 ; i <= n ; i++ )
		for( j = 1 ; j <= n ; j++ )
			{
				scanf("%d" , &x);
				G[i].pb(mkp(n+j,x));
				G[n+j].pb(mkp(i,-x));
				C[i][n+j] = 1;
			}
	for( i = 1 ; i <= n ; i++ )
		{
			G[S].pb(mkp(i,0));
			G[i].pb(mkp(S,0));
			C[S][i] = 1;
			G[n+i].pb(mkp(D,0));
			G[D].pb(mkp(n+i,0));
			C[n+i][D] = 1;
		}
}

int Bellman_Ford(int S, int D)
{
	int nod;
	vector< pair<int,int> >::iterator it;
	memset(inQ,0,sizeof(inQ));
	memset(T,0,sizeof(T));
	memset(d,INF,sizeof(d));
	inQ[S] = 1;
	Q.push(S);
	d[S] = 0;
	while( !Q.empty() )
		{
			nod = Q.front();
			Q.pop();
			inQ[nod] = 0;
			if( nod == D )
				continue;
			for( it = G[nod].begin() ; it != G[nod].end() ; ++it )
				if( C[nod][it->first] > F[nod][it->first] && d[it->first] > d[nod] + it->second )
					{
						d[it->first] = d[nod] + it->second;
						T[it->first] = nod;
						if( !inQ[it->first] )
							{
								inQ[it->first] = 1;
								Q.push(it->first);
							}
					}
		}
	return T[D];
}

int FLUX()
{
	int Flux = 0;
	while( Bellman_Ford(S,D) )
		{
			int fluxmin,nod;
			fluxmin = INF;
			for( nod = D ; nod != S ; nod = T[nod] )
				fluxmin = minim(fluxmin, C[T[nod]][nod]-F[T[nod]][nod] );
			if( fluxmin == 0)
				continue;
			for( nod = D ; nod != S ; nod = T[nod] )
				{
					F[T[nod]][nod] += fluxmin;
					F[nod][T[nod]] -= fluxmin;
				}
			Flux += (fluxmin*d[D]);
		}
	return Flux;
}

int main()
{
	Read();
	freopen( OutFile , "w" , stdout );
	printf("%d\n" , FLUX() );
	return 0;
}