#include <fstream>
#include <queue>
#define DIM 210
#define inf 2000000000
using namespace std;
ifstream fin("cc.in");
ofstream fout("cc.out");
int n,m,i,mini,nod,a,b,cap,sol,start,fina,pret,j;
int c[DIM][DIM], f[DIM][DIM], k[DIM][DIM];
int d[DIM], t[DIM], h[DIM];
deque<int> co;
vector<int> v[DIM];

int bellma()
{
    int nod,vecin;
    for(int i=1;i<=n;i++)
    {
        d[i]=inf;
        h[i]=0;
    }
    d[start]=0;h[start]=1;
    co.clear();co.push_back(start);
    while(!co.empty())
    {
        nod=co.front();
        co.pop_front();
        h[nod]=0;
        for(int i=0;i<v[nod].size();i++)
        {
            vecin=v[nod][i];
            if(c[nod][vecin]>f[nod][vecin]&&d[vecin]>d[nod]+k[nod][vecin])
            {
                d[vecin]=d[nod]+k[nod][vecin];
                t[vecin]=nod;
                if(h[vecin]==0)
                {
                    co.push_back(vecin);
                    h[vecin]=1;
                }
            }
        }
    }
    if(d[fina]==inf)
        return 0;
    else
        return 1;
}

int main()
{
    fin>>n;n+=1;start=1;fina=n*2;
    for(i=2;i<=n;i++)
    {
        for(j=2;j<=n;j++)
        {
            fin>>pret;
            v[i].push_back(j+n-1);v[j+n-1].push_back(i);
            k[i][j+n-1]=pret;k[j+n-1][i]=-pret;
            c[i][j+n-1]=1;
        }
    }
    for(i=2;i<=n;i++)
    {
        v[1].push_back(i);v[i].push_back(1);
        c[1][i]=1;
        v[i+n-1].push_back(2*n);v[2*n].push_back(i+n-1);
        c[i+n-1][2*n]=1;
    }
    n=n*2;
    while(bellma())
    {
        mini=inf;nod=fina;
        while(t[nod])
        {
            mini=min(mini,c[t[nod]][nod]-f[t[nod]][nod]);
            nod=t[nod];
        }
        nod=fina;
        while(t[nod])
        {
            sol+=mini*k[t[nod]][nod];
            f[t[nod]][nod]+=mini;
            f[nod][t[nod]]-=mini;
            nod=t[nod];
        }
    }
    fout<<sol;
    return 0;
}