#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <climits>

using namespace std;

bool bfs(int t, vector<vector<int>>& muchii, vector<vector<int>>& cap, vector<vector<int>>& flux,
    vector<vector<int>>& cost, vector<int>& tata, vector<int>& costMin){
    for(int i = 1; i < tata.size(); i++){
        tata[i] = -1;
        costMin[i] = INT_MAX;
    }

    tata[0] = 0;
    costMin[0] = 0;

    queue<int> q;
    q.push(0);

    int fluxMin = INT_MAX;
    while(!q.empty()){
        int x = q.front();
        q.pop();

        for(int i = 0; i < muchii[x].size(); i++){
            int y = muchii[x][i];

            if((cap[x][y] - flux[x][y]) && (costMin[x] + cost[x][y] < costMin[y])){
                tata[y] = x;
                costMin[y] = costMin[x] + cost[x][y];

                fluxMin = min(fluxMin, cap[x][y] - flux[x][y]);
                q.push(y);
            }
        }
    }
    
    return tata[t] != -1;
}

int main(){
    ifstream f("cc.in");
    ofstream g("cc.out");

    int n;
    f >> n;

    int t = 2*n+1;

    vector<vector<int>> muchii(t+1);
    vector<vector<int>> capacitate(t+1, vector<int>(t+1, 0));
    vector<vector<int>> flux(t+1, vector<int>(t+1, 0));
    vector<vector<int>> cost(t+1, vector<int>(t+1, 0));
    vector<int> tata(t+1);
    vector<int> costMin(t+1);

    for(int i = 1; i <= n; i++){
        muchii[0].push_back(i);
        muchii[i].push_back(0);
        capacitate[0][i] = 1;

        for(int j = 1; j <= n; j++){
            int c;
            f >> c;

            muchii[i].push_back(j+n);
            muchii[j+n].push_back(i);
            capacitate[i][j+n] = 1;
            cost[i][j+n] = c;
            cost[j+n][i] = -c;
        }
    }

    for(int i = 1; i <= n; i++){
        muchii[i+n].push_back(t);
        muchii[t].push_back(i+n);
        capacitate[i+n][t] = 1;
    }

    int costMinim = 0;
    while(1){
        int f = bfs(t, muchii, capacitate, flux, cost, tata, costMin);

        if(f){
            costMinim += costMin[t];

            int x = t;
            while(x){
                flux[tata[x]][x] += f;
                flux[x][tata[x]] -= f;
                x = tata[x];
            }
        }
        else
            break;
    }
    g << costMinim << "\n";
    return 0;
}