#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>

#define newn a[x][i]

using namespace std;

ifstream fin("cc.in");
ofstream fout("cc.out");

const int N = 105*2;
const int oo = 0x3f3f3f3f;

int n, s, d, sol, t[N], c[N][N], cst[N][N], real[N], dist[N], oldd[N];
typedef pair <int, int> nod;
priority_queue < nod, vector<nod>, greater<nod> > h;
vector <int> a[N];

inline bool Dijkstra()
{
    memset(dist, oo, sizeof dist);
    dist[s] = real[s] = 0;
    h.push(nod(0, s));
    while(!h.empty())
    {
        int val = h.top().first, x = h.top().second; h.pop();
        if(val != dist[x]) continue;
        for(unsigned i=0; i<a[x].size(); i++)
            if(c[x][newn])
            {
                int cost = dist[x] + cst[x][newn] + oldd[x] - oldd[newn];
                if(cost < dist[newn])
                {
                    t[newn] = x;
                    dist[newn] = cost;
                    real[newn] = real[x] + cst[x][newn];
                    h.push(nod(dist[newn], newn));
                }
            }
    }
    memcpy(oldd, real, sizeof oldd);
    return (dist[d] != oo);
}

int main()
{
    fin>>n;
    s = 0, d = 2*n+1;
    for(int i=1; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            int x; fin>>x;
            a[i].push_back(n+j);
            a[j+n].push_back(i);
            c[i][n+j] = 1;
            cst[i][n+j] -= cst[n+j][i] -= x;
        }
    for(int i=1; i<=n; i++)
    {
        c[s][i] = c[i+n][d];
        a[s].push_back(i);
        a[i].push_back(s);
        a[i+n].push_back(d);
        a[d].push_back(i+n);
    }
    while(Dijkstra())
    {
        int fmin = oo;
        for(int j=d; j!=s; j=t[j])
            fmin = min(fmin, c[t[j]][j]);
        for(int j=d; j!=s; j=t[j])
        {
            c[t[j]][j] -= fmin;
            c[j][t[j]] += fmin;
        }
        sol += fmin * real[d];
    }
    fout<<sol;
    return 0;
}