#include<stdio.h>

 #include<string.h>

 #include<algorithm>

 #include<math.h>

 using namespace std;

 const int INF=0x3f3f3f3f;

 const int maxn=;

 int g[maxn][maxn],match[maxn],lx[maxn],ly[maxn],visx[maxn],visy[maxn],s[maxn],n,m;

 bool hungary(int u){

     visx[u]=;

     for(int i=;i<=n;++i){

         if(!visy[i]&&lx[u]+ly[i]==g[u][i]){

             visy[i]=;

             if(!match[i]||hungary(match[i])){

                 match[i]=u;

                 return ;

             }

         }

         else if(!visy[i])s[i]=min(s[i],lx[u]+ly[i]-g[u][i]);

     }

     return ;

 }

 int KM(){

     for(int i=;i<=n;++i){

         for(int j=;j<=n;++j)s[j]=INF;

         while(){

             memset(visx,,sizeof(visx));

             memset(visy,,sizeof(visy));

             if(hungary(i))break;

             int d=INF;

             for(int j=;j<=n;++j)

                 if(!visy[j])d=min(d,s[j]);

             for(int j=;j<=n;++j){

                 if(visx[j])lx[j]-=d;

                 if(visy[j])ly[j]+=d;

                 else s[j]-=d;

             }

         }

     }

     int ans=;

     for(int i=;i<=n;++i)ans+=g[match[i]][i];

     return ans;

 }

 int main(){

     while(scanf("%d",&n)!=EOF){

         memset(lx,,sizeof(lx));

         memset(ly,,sizeof(ly));

         memset(match,,sizeof(match));

         for(int i=;i<=n;++i){

             for(int j=;j<=n;++j){

                 scanf("%d",&g[i][j]);

                 lx[i]=max(lx[i],g[i][j]);

             }

         }

         printf("%d\n",KM());

     }

     return ;

 }