#include<fstream>
#include<bitset>
#include<deque>
#include<vector>
#define DIM 205
using namespace std;
int n, i, j, minim, u, sum, d, cost;
int c[DIM][DIM], f[DIM][DIM], z[DIM][DIM], t[DIM], sd[DIM];
deque<int> cd;
bitset<DIM> viz;
vector<int> v[DIM];
ifstream fin("cc.in");
ofstream fout("cc.out");
int bf(){
    int i, nod, vecin;
    int ok = 0;
    cd.clear();
    for(i = 0; i <= d; i++){
        viz[i] = 0;
        sd[i] = 1000000000;
    }
    cd.push_back(0);
    viz[0] = 1;
    sd[0] = 0;
    t[0] = -1;
    while(!cd.empty()){
        nod = cd.front();
        viz[nod] = 0;
        for(i = 0; i < v[nod].size(); i++){
            vecin = v[nod][i];
            if(c[nod][vecin] > f[nod][vecin] && sd[vecin] > sd[nod] + z[nod][vecin]){
                sd[vecin] = sd[nod] + z[nod][vecin];
                t[vecin] = nod;
                if(viz[vecin] == 0){
                    viz[vecin] = 1;
                    cd.push_back(vecin);
                }
                if(vecin == d){
                    ok = 1;
                }
            }
        }
        cd.pop_front();
    }
    return ok;
}
int main(){
    fin>> n;
    d = 2 * n + 1;
    for(i = 1; i <= n; i++){
        for(j = n + 1; j < d; j++){
            fin>> cost;
            z[i][j] = cost;
            z[j][i] = -cost;
            v[i].push_back(j);
            v[j].push_back(i);
            c[i][j] = 1;
        }
    }
    for(i = 1; i <= n; i++){
        c[0][i] = 1;
        v[0].push_back(i);
        v[i].push_back(0);
    }
    for(i = n + 1; i < d; i++){
        c[i][d] = 1;
        v[d].push_back(i);
        v[i].push_back(d);
    }
    while( bf() ){
        minim = 1000000;
        for(u = d; t[u] >= 0; u = t[u]){
            minim = min(minim, c[ t[u] ][u] - f[ t[u] ][u]);
        }
        for(u = d; t[u] >= 0; u = t[u]){
            f[ t[u] ][u] += minim;
            f[u][ t[u] ] -= minim;
            sum += z[ t[u] ][u] * minim;
        }
    }
    fout<< sum <<"\n";
    return 0;
}