#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <queue>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

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

const int NMAX=205;
const int INF=2e9;

vector<pair<int,int>>v[NMAX];

int t[NMAX];
int dist[NMAX];
int flux[NMAX][NMAX];
bool viz[NMAX];

int n,m,s,d;

int bellman()
{
    int i;
    for(i=0;i<=2*n+1;i++)
    {
        viz[i]=false;
        dist[i]=INF;
    }
    queue<int>q;
    q.push(s);
    dist[s]=0;
    viz[s]=true;
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        viz[p]=false;
        for(auto i:v[p])
        {
            if(flux[p][i.first]>0 && dist[i.first]>dist[p]+i.second)
            {
                dist[i.first]=dist[p]+i.second;
                if(!viz[i.first])
                {
                    q.push(i.first);
                    viz[i.first]=true;
                }
                t[i.first]=p;
            }
        }
    }
    return dist[d];
}

int main()
{
    int i,j,x,y,cost,maxi=0,mini;
    bool ok=true;
    fin>>n;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
        {
            fin>>cost;
            v[i].push_back(make_pair(j+n,cost));
            v[j+n].push_back(make_pair(i,-cost));
            flux[i][j+n]=1;
        }
    s=0;
    d=2*n+1;
    for(i=1;i<=n;i++)
    {
        v[0].push_back(make_pair(i,0));
        v[i].push_back(make_pair(0,0));
        v[2*n+1].push_back(make_pair(i+n,0));
        v[i+n].push_back(make_pair(2*n+1,0));
        flux[0][i]=1;
        flux[i+n][2*n+1]=1;
    }
    while(true)
    {
        mini=INF;
        int suma=bellman();
        if(suma==INF)
            break;
        x=d;
        while(x!=s)
        {
            mini=min(mini,flux[t[x]][x]);
            x=t[x];
        }
        x=d;
        while(x!=s)
        {
            flux[x][t[x]]+=mini;
            flux[t[x]][x]-=mini;
            x=t[x];
        }
        maxi=maxi+mini*suma;
    }
    fout<<maxi;
    return 0;
}