#include <cstdio>
#include <vector>
#include <bitset>
#include <queue>
#define nmax 210
#define inf 1<<30
using namespace std;
vector <int> v[nmax];
queue <int> q;
bitset <nmax> in;
int n,f[nmax][nmax],c[nmax][nmax],z[nmax][nmax];
int d[nmax],t[nmax];
int sol,dest;

int bfs()
{
    int x,y,i;
    for (i=1;i<=dest;i++)
        d[i]=inf;
    d[0]=t[0]=0;
    q.push(0);
    in[0]=1;
    while (!q.empty()) {
        x=q.front();
        q.pop();
        in[x]=0;
        for (i=0;i<v[x].size();i++) {
            y=v[x][i];
            if (d[x]+z[x][y]<d[y]&&f[x][y]<c[x][y]) {
                d[y]=d[x]+z[x][y];
                t[y]=x;
                if (in[y]==0) {
                    in[y]=1;
                    q.push(y);
                }
            }
        }
    }
    if (d[dest]==inf)
        return 0;
    return 1;

}
int main()
{
    freopen("cc.in","r",stdin);
    freopen("cc.out","w",stdout);
    scanf("%d",&n);
    dest=2*n+1;
    int i,j;
    for (i=1;i<=n;i++) {
        v[0].push_back(i);
        v[i].push_back(0);
        c[0][i]=1;
    }
    for (i=1;i<=n;i++) {
        v[dest].push_back(i+n);
        v[i+n].push_back(dest);
        c[i+n][dest]=1;
    }
    for (i=1;i<=n;i++) {
        for (j=n+1;j<=n*2;j++) {
            scanf("%d",&z[i][j]);
            z[j][i]=-z[i][j];
            c[i][j]=1;
            v[i].push_back(j);
            v[j].push_back(i);
        }
    }
    while (bfs()) {
        sol+=d[dest];
        for (i=dest;i;i=t[i]) {
            f[t[i]][i]++;
            f[i][t[i]]--;
        }
    }
    printf("%d\n",sol);

    return 0;
}