// problema minCoverWithTowers

#include <fstream>

using namespace std;

const int MAX_N = 1000;
const int MAX_VAL = 100;
int chessboard[MAX_N][MAX_N];

int main()
{
    ifstream fin("input.txt");
    int cbSize; fin>>cbSize;

    int sum1 = 0, sum2 = 0;
    int max1 = MAX_VAL, max2 = MAX_VAL;

    for(int i=0; i<cbSize; i++)
        for(int j=0; j<cbSize; j++)
            fin>>chessboard[i][j];

    for(int i=0; i<cbSize; i++)
    {
        for(int j=0; j<cbSize; j++)
        {
            max1 = (chessboard[i][j]<max1 ? chessboard[i][j] : max1);
            max2 = (chessboard[j][i]<max2 ? chessboard[j][i] : max2);
        }
        sum1 += max1; sum2 += max2;
        max1 = max2 = MAX_VAL;
    }

    ofstream fout("output.txt");
    fout<<min(sum1, sum2);
    fin.close(); fout.close();

    return 0;
}