#include <bits/stdc++.h>
using namespace std;
ifstream fin ("cc.in");
ofstream fout ("cc.out");
const int NMAX = 201;
int n, maxflux, cost, dist, sink, m;
struct much{
int a, b, c, f, z, per;
};
vector <much> a;
vector <int> v[NMAX+1];
int last[NMAX+1], d[NMAX+1], reald[NMAX+1], dvechi[NMAX+1];
void omul_cu_clopot_vad(){
for(int i = 0; i <= sink; i++){
reald[i] = INT_MAX;
}
reald[0] = 0;
for(int i = 0; i < sink; i++){
for(int j = 0; j < a.size(); j++){
if(reald[a[j].a] != INT_MAX){
reald[a[j].b] = min(reald[a[j].a] + a[j].z, reald[a[j].b]);
}
}
}
}
void deschistra(){
for(int i = 0; i <= sink; i++){
dvechi[i] = reald[i];
d[i] = INT_MAX;
last[i] = -1;
}
d[0] = 0;
reald[0] = 0;
last[0] = -2;
priority_queue <pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> q;
q.push({0, 0});
int nod, dnou;
much nxt;
while(!q.empty()){
nod = q.top().second;
dnou = q.top().first;
q.pop();
if(dnou != d[nod]){
continue;
}
for(int i = 0; i < v[nod].size(); i++){
nxt = a[v[nod][i]];
if(nxt.f < nxt.c &&
dnou + nxt.z + dvechi[nxt.a] - dvechi[nxt.b] < d[nxt.b]){
d[nxt.b] = dnou + nxt.z + dvechi[nxt.a] - dvechi[nxt.b];
reald[nxt.b] = reald[nod] + nxt.z;
last[nxt.b] = v[nod][i];
q.push({d[nxt.b], nxt.b});
}
}
}
}
void fa_un_drum(){
int nod = sink, minim_ude = INT_MAX;
while(last[nod] != -2){
minim_ude = min(minim_ude, a[last[nod]].c - a[last[nod]].f);
nod = a[last[nod]].a;
}
maxflux += minim_ude;
cost += minim_ude * reald[sink];
nod = sink;
while(last[nod] != -2){
a[last[nod]].f += minim_ude;
a[a[last[nod]].per].f -= minim_ude;
nod = a[last[nod]].a;
}
}
void flux(){
int lastflux = -1;
while(lastflux != maxflux){
lastflux = maxflux;
deschistra();
if(last[sink] != -1){
fa_un_drum();
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fin >> n;
sink = 2 * n + 1;
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
fin >> dist;
a.push_back({i, n + j, 1, 0, dist, 0});
}
}
for(int i = 1; i <= n; i++){
a.push_back({0, i, 1, 0, 0, 0});
a.push_back({n + i, sink, 1, 0, 0, 0});
}
m = a.size();
for(int i = 0; i < m; i++){
a.push_back({a[i].b, a[i].a, 0, 0, -a[i].z, i});
a[i].per = i + m;
v[a[i].a].push_back(i);
v[a[i].b].push_back(i + m);
}
omul_cu_clopot_vad();
flux();
fout << cost;
return 0;
}