#include <fstream>
#include <vector>
#include <queue>
#define INF 0x3f3f3f3f
#define mp make_pair
#define nodv g[nod][i]
using namespace std;

ifstream is("cc.in");
ofstream os("cc.out");

int n, flux, fmin, answ;
vector<int> t, d;
vector<vector<int> > g, cost, cap;

void Read();
bool Dijkstra();

int main()
{
    Read();
    t = d = vector<int>(2 * n + 2);
    while ( Dijkstra() );
    os << answ;
    is.close();
    os.close();
    return 0;
}

bool Dijkstra()
{
    priority_queue<pair<int, int>, vector<pair<int, int> >, greater<pair<int, int> > > q;
    d.assign(2 * n + 2, INF);
    d[0] = 0;
    q.push(mp(0, 0));
    int nod, cst;
    while ( !q.empty() )
    {
        nod = q.top().second;
        cst = q.top().first;
        q.pop();
        if ( cst != d[nod] || nod == 2 * n + 1 )
            continue;
        for ( size_t i = 0; i < g[nod].size(); ++i )
            if ( cap[nod][nodv] > 0 && d[nodv] > d[nod] + cost[nod][nodv] )
            {
                d[nodv] = d[nod] + cost[nod][nodv];
                t[nodv] = nod;
                q.push(mp(d[nodv], nodv));
            }
    }
    if ( d[2 * n + 1] == INF )
        return false;
    fmin = INF;
    for ( int x = 2 * n + 1; x; x = t[x] )
        fmin = min(fmin, cap[t[x]][x]);
    for ( int x = 2 * n + 1; x; x = t[x] )
    {
        cap[t[x]][x] -= fmin;
        cap[x][t[x]] += fmin;
    }
    answ += fmin * d[2 * n + 1];
    return true;
}

void Read()
{
    is >> n;
    cost = vector<vector<int> >(2 * n + 2, vector<int>(2 * n + 2));
    cap = vector<vector<int> >(2 * n + 2, vector<int>(2 * n + 2));
    g = vector<vector<int> >(2 * n + 2);
    for ( int i = 1; i <= n; ++i )
        for ( int j = n + 1; j <= 2 * n; ++j )
        {
            is >> cost[i][j];
            cap[i][j] = 1;
            cost[j][i] = -cost[i][j];
            g[i].push_back(j);
            g[j].push_back(i);
        }
    for ( int i = 1; i <= n; ++i )
    {
        cap[0][i] = 1;
        g[0].push_back(i);
        g[i].push_back(0);
    }
    for ( int i = n + 1; i <= 2 * n; ++i )
    {
        cap[i][2 * n + 1] = 1;
        g[i].push_back(2 * n + 1);
        g[2 * n + 1].push_back(i);
    }
}