#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <bitset>
using namespace std;

#define Nmax 202
#define inf 0x3f3f3f3f

FILE *f = fopen ( "cc.in", "r" );
FILE *g = fopen ( "cc.out", "w" );

int N, Sink, Source;
int Cap[Nmax][Nmax], Flow[Nmax][Nmax], Cost[Nmax][Nmax], Tata[Nmax], Dist[Nmax];
vector < int > G[Nmax];
queue < int > Q;
bitset < Nmax > inQ;

bool BellmanFord(){

    vector < int > :: iterator it;

    for ( int i = Source; i <= Sink; ++i ){
        Dist[i] = inf;
        inQ[i] = 0;
    }

    Dist[Source] = 0;
    Q.push ( Source );
    inQ[Source] = 1;

    while ( !Q.empty() ){
        int nod = Q.front();
        Q.pop();
        inQ[nod] = 0;
        for ( it = G[nod].begin(); it < G[nod].end(); ++it ){
            if ( Cap[nod][*it] > Flow[nod][*it] && Dist[*it] > Dist[nod] + Cost[nod][*it] ){
                Dist[*it] = Dist[nod] + Cost[nod][*it];
                Tata[*it] = nod;
                if ( !inQ[*it] ){
                    Q.push ( *it );
                    inQ[*it] = 1;
                }
            }
        }
    }
    return Dist[Sink] != inf;
}

void FMCM(){
    int MinFlow, TotaCost = 0;

    while ( BellmanFord() ){
        MinFlow = inf;

        for ( int nod = Sink; nod != Source; nod = Tata[nod] )
            MinFlow = min ( MinFlow, Cap[Tata[nod]][nod] - Flow[Tata[nod]][nod] );

        for ( int nod = Sink; nod != Source; nod = Tata[nod] ){
            Flow[Tata[nod]][nod] += MinFlow;
            Flow[nod][Tata[nod]] -= MinFlow;
        }

        TotaCost += MinFlow * Dist[Sink];
    }

    fprintf ( g, "%d", TotaCost );
}


int main(){

    int c;

    fscanf ( f, "%d", &N );

    Source = 0; Sink = N + N + 1;

    for ( int i = 1; i <= N; ++i ){
        for ( int j = 1; j <= N; ++j ){
            fscanf ( f, "%d", &c );
            G[i].push_back ( j + N );
            G[j+N].push_back ( i );
            Cap[i][j+N] = 1;
            Cost[i][j+N] = c;
            Cost[j+N][i] = -c;
        }
    }

    for ( int i = 1; i <= N; ++i ){
        G[Source].push_back ( i );
        G[i].push_back ( Source );
        Cap[Source][i] = 1;
    }

    for ( int i = N + 1; i <= N + N; ++i ){
        G[i].push_back ( Sink );
        G[Sink].push_back ( i );
        Cap[i][Sink] = 1;
    }

    FMCM ();

    return 0;
}