#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
ifstream f("cc.in");
ofstream g("cc.out");
int N, x, sol, dad[205], flux[205][205], cap[205][205], inQ[205], D[205];
vector < pair < int, int > > G[205];
queue < int > Q;
void bellman(int sursa)
{
    for (int i=1; i<=2*N+1; ++i)
        D[i]=(1<<30);
    Q.push(sursa); inQ[sursa]=1; D[sursa]=0;
    while (Q.size())
    {
        int nod=Q.front(); inQ[nod]=0; Q.pop();
        vector< pair<int, int> >::iterator it=G[nod].begin();
        for (; it!=G[nod].end(); ++it)
            if (D[it->first] > D[nod] + it->second && cap[nod][it->first]>flux[nod][it->first])
            {
                D[it->first]=D[nod]+it->second; dad[it->first]=nod;
                if (!inQ[it->first])
                    Q.push(it->first), inQ[it->first]=1;
            }
    }
}
void cuplaj()
{
    for (int j=1; j<=N; ++j)
    {
        bellman(0);
        for (int x=2*N+1; x!=0; x=dad[x])
            ++flux[dad[x]][x], --flux[x][dad[x]];
        sol+=D[2*N+1];
    }
}

int main()
{
    f>>N;
    for (int i=1; i<=N; ++i)
    {
        G[0].push_back(make_pair(i, 0));
        G[i].push_back(make_pair(0, 0));
        cap[0][i]=1;
        for (int j=1; j<=N; ++j)
        {
            f>>x;
            G[i].push_back(make_pair(j+N, x));
            G[j+N].push_back(make_pair(i, -x));
            G[j+N].push_back(make_pair(2*N+1, 0));
            G[2*N+1].push_back(make_pair(j+N, 0));
            cap[i][j+N]=cap[j+N][2*N+1]=1;
        }
    }
    cuplaj();
    g<<sol<<'\n';
    return 0;
}