#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("cc.in");
ofstream fout("cc.out");

#define maxn 256
#define pb push_back
#define oo 200000000

int i,j,N,s,d,flmin,k,R;
int D[maxn][maxn],C[maxn][maxn],Dist[maxn],v[maxn],from[maxn];
vector <int> A[maxn];
queue <int> Q;

inline int min(int a,int b)
{
	return a<b ? a : b;
}

void citire()
{
	fin >> N;
	for(i=1;i<=N;i++)
		for(j=1;j<=N;j++)
		{
			fin >> D[i][j+N];
			D[j+N][i]=-D[i][j+N];
		}
	for(i=1;i<=N;i++)
		for(j=1;j<=N;j++)
		{
			A[i].pb(j+N);
			A[j+N].pb(i);
			C[i][j+N]=1;
		}
	s=0; d=2*N+1; //sursa si destinatie virtuala
	for(i=1;i<=N;i++)
	{
		C[s][i]=1;
		A[s].pb(i);
		A[i].pb(s);
		C[i+N][d]=1;
		A[d].pb(i+N);
		A[i+N].pb(d);
	}
}

int BF()
{
	for(i=s;i<=d;i++) { from[i]=0; Dist[i]=oo; v[i]=0; }
	Q.push(s); Dist[s]=0;
	for(;!Q.empty();Q.pop())
	{
		k=Q.front();
		for(i=0;i<(int)A[k].size();i++)
			if(C[k][A[k][i]]>0 && Dist[k]+D[k][A[k][i]]<Dist[A[k][i]])
			{
				Dist[A[k][i]]=Dist[k]+D[k][A[k][i]];
				from[A[k][i]]=k;
				if(!v[A[k][i]])
					Q.push(A[k][i]);
				v[A[k][i]]=1;
			}
		v[k]=0;	
	}
	return Dist[d]<oo;
}

int main()
{
	citire();
	while( BF() )
	{
		flmin=oo;
		for(k=d;k!=s;k=from[k])
			flmin=min(flmin,C[from[k]][k]);
		for(k=d;k!=s;k=from[k])
		{
			C[from[k]][k]-=flmin;
			C[k][from[k]]+=flmin;
		}
		R+=flmin*Dist[d];
	}
	fout << R;
}