#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

const int MAX_N = 1000;
const int MAX_C = 100;

int main () {
    int n, i, k, min_r, min_c, scacchiera[MAX_N][MAX_N], min_colonne[MAX_N], min_righe[MAX_N];

    ifstream fin ("input.txt");
    fin >> n;
    for (i = 0; i < n; i++)
        for (k = 0; k < n; k++) fin >> scacchiera[i][k];
    fin.close ();
    for (i = 0; i < n; i++) {
        min_righe[i] = MAX_C;
        for (k = 0; k < n; k++) if (scacchiera[i][k] < min_righe[i]) min_righe[i] = scacchiera[i][k];
        min_colonne[i] = MAX_C;
        for (k = 0; k < n; k++) if (scacchiera[k][i] < min_colonne[i]) min_colonne[i] = scacchiera[k][i];
    }
    sort (min_righe, min_righe + n);
    sort (min_colonne, min_colonne + n);
    min_r = 0;
    min_c = 0;
    for (k = 0; k < n; k++) min_r += min_righe[k];
    for (k = 0; k < n; k++) min_c += min_colonne[k];
    ofstream fout("output.txt");
    if (min_r < min_c) fout << min_r << endl;
    else fout << min_c << endl;
    fout.close();

    return 0;
}