#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("cc.in");
ofstream g("cc.out");
int n,X,st,dr,m;
const int N=205;
int dist[N];
int d[N][N];
int flux[N][N],dad[N];
bool viz[N];
vector<int>a[N];
int blm(int st,int dr)
{
    for(int i=st;i<=dr;i++)
    {
        dad[i]=0;
        viz[i]=0;
        dist[i]=1e9;
    }
    dist[0]=0;
    viz[0]=1;
    queue<int>q;
    q.push(st);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        viz[nod]=false;
        for(auto x: a[nod])
        {
            if(flux[nod][x]>0&&dist[x]>dist[nod]+d[nod][x])
            {
                dist[x]=dist[nod]+d[nod][x];
                dad[x]=nod;
                if(viz[x]==false)
                {
                    viz[x]=true;
                    q.push(x);
                }
            }
        }
    }
    return dist[dr];
}
int main()
{
    f>>n;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
        {
            f>>X;
            d[i][j+n]=X;
            d[j+n][i]=-X;
            flux[i][j+n]=1;
            a[i].push_back(j+n);
            a[j+n].push_back(i);
        }
    ///start fictiv 0
    ///final fictiv 2n+1
    for(int i=1;i<=n;i++)
    {
        a[0].push_back(i);
        a[i].push_back(0);
        a[2*n+1].push_back(i+n);
        a[i+n].push_back(2*n+1);
        flux[0][i]=1;
        flux[i+n][2*n+1]=1;
    }
    st=0;dr=2*n+1;
    int val=0;
    while(true)
    {
        int sum=blm(st,dr);
        if(sum==1e9)
            break;
        int mn=1e9;
        for(int i=dr;i!=st;i=dad[i])
            mn=min(mn,flux[dad[i]][i]);
        for(int i=dr;i!=st;i=dad[i])
        {
            flux[dad[i]][i]-=mn;
            flux[i][dad[i]]+=mn;
        }
        val=val+sum*mn;
    }
    g<<val;
    return 0;
}