#include <cstdio>
#include <vector>
#include <bitset>
#include <algorithm>
#include <queue>
#include <memory.h>

#define super_start 0
#define super_sink 2*N+1
#define Nmax 205
#define INF 0x3f3f3f3f

using namespace std;
int N,flow[Nmax][Nmax],capacity[Nmax][Nmax],cost[Nmax][Nmax];
int DP[Nmax],daddy[Nmax],minFLOW,maxFLOW,minCOST;

bitset<Nmax> inQ;
queue<int> Q;
vector<int> G[Nmax];

inline void read()
{
    scanf("%d",&N);
    int x;
    for(int i = 1; i <= N; ++i)
        for(int j = 1; j <= N; ++j)
        {
            scanf("%d",&x);
            G[i].push_back(j+N);
            G[j+N].push_back(i);
            cost[i][j+N] = x;
            cost[j+N][i] = -x;
            capacity[i][j+N] = 1;
        }
    for(int i = 1; i <= N; ++i)
    {
        G[super_start].push_back(i);
        G[i].push_back(super_start);
        capacity[super_start][i] = 1;
    }
    for(int i  = N+1; i <= 2*N; ++i)
    {
        G[i].push_back(super_sink);
        G[super_sink].push_back(i);
        capacity[i][super_sink] = 1;
    }
}

inline bool bellman(int k)
{
    memset(DP,INF,sizeof(DP));
    DP[k] = 0; Q.push(k);
    while(!Q.empty())
    {
        k = Q.front(); Q.pop(); inQ[k] = 0;
        if(k == super_sink) continue;
        for(vector<int>::iterator it = G[k].begin(); it != G[k].end(); ++it)
            if(DP[*it] > DP[k] + cost[k][*it] && capacity[k][*it] - flow[k][*it] != 0)
            {
                DP[*it] = DP[k] + cost[k][*it];
                daddy[*it] = k;
                if(inQ[*it]) continue;
                Q.push(*it);inQ[*it] = 1;
            }
    }
    return DP[super_sink] != INF;
}

inline void FLOW()
{
    while(bellman(super_start))
    {
        minFLOW = INF;
        if(DP[super_sink] == INF) continue;
        for(int nodc = super_sink;nodc;nodc=daddy[nodc])
            minFLOW = min(minFLOW,capacity[daddy[nodc]][nodc] - flow[daddy[nodc]][nodc]);
        for(int nodc = super_sink;nodc;nodc=daddy[nodc])
        {
            flow[daddy[nodc]][nodc] += minFLOW;
            flow[nodc][daddy[nodc]] -= minFLOW;
        }
        minCOST += DP[super_sink];
        maxFLOW += minFLOW;
    }
    printf("%d\n",minCOST);
}

int main()
{
    freopen("cc.in","r",stdin);
    freopen("cc.out","w",stdout);

    read();
    FLOW();

    return 0;
}