#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int nmax=223;
vector<int>adj[nmax];
int n,sursa,destinatie;
int t[nmax],distt[nmax],dist[nmax][nmax],c[nmax][nmax],f[nmax][nmax];
priority_queue< pair<int,int> , vector< pair<int,int> >, greater< pair<int,int> > >dj;
void citeste()
{
    scanf("%d",&n);
    sursa=1,destinatie=2*n+2;
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            int v;
            scanf("%d",&v);
            adj[i+1].push_back(j+n+1);
            adj[j+n+1].push_back(i+1);
            dist[i+1][j+n+1]=v;
            dist[j+n+1][i+1]=-v;
            c[i+1][j+n+1]=1;
        }
    }
    for(int i=1;i<=n;i++)
    {
        adj[sursa].push_back(i+1);
        adj[i+1].push_back(1);
        c[sursa][i+1]=1;
    }
    for(int i=2;i<=n+1;i++)
    {
        adj[i+n].push_back(destinatie);
        adj[destinatie].push_back(i+n);
        c[i+n][destinatie]=1;
    }
}
int dijkstra()
{
    memset(t,-1,sizeof(t));
    memset(distt,0x3f3f3f3f,sizeof(distt));
    dj.push(make_pair(0,sursa));
    distt[sursa]=0;
    while(!dj.empty())
    {
        int nod=dj.top().second,dd=dj.top().first;
        dj.pop();
        if(dd!=distt[nod]||nod==destinatie) continue;
       // printf("%d\n",nod);
        for(vector<int>::iterator it=adj[nod].begin();it!=adj[nod].end();++it)
        {
       //     printf("%d %d %d %d %d %d\n",nod,*it,c[nod][*it],distt[*it],distt[nod],dist[nod][*it]);
            if(c[nod][*it]-f[nod][*it]<=0) continue;
            if(distt[*it]>distt[nod]+dist[nod][*it])
            {
                distt[*it]=distt[nod]+dist[nod][*it];
                t[*it]=nod;
                dj.push(make_pair(distt[*it],*it));
            }
        }
    }
    if(distt[destinatie]==0x3f3f3f3f) return 0;
    return 1;
}
int main()
{
    freopen ("cc.in","r",stdin);
    freopen ("cc.out","w",stdout);
    citeste();
    int maxim=0,flow=0;
    while(dijkstra())
    {
        int minim=0x3f3f3f3f;
        for(int i=destinatie;i!=sursa;i=t[i]) minim=min(minim,c[t[i]][i]-f[t[i]][i]);
       // printf("%d\n",minim);
        maxim+=distt[destinatie]*minim;
        flow+=minim;
        for(int i=destinatie;i!=sursa;i=t[i])
        {
            f[t[i]][i]+=minim;
            f[i][t[i]]-=minim;
        }
    }
    printf("%d\n",maxim);
}