#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
template<class T, class S, class U> inline void DigitF_L(T n, int sz, S res[], U b){
  int i;
  for(i=(0);i<(sz);i++){
    res[i] = n % b;
    n /= b;
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int N;
long long C[9][9];
long long dp[9][20000];
long long pw[10];
int arr[10];
int main(){
  int mask;
  int i;
  int j;
  int k;
  int p;
  long long res = 4611686016279904256LL;
  rd(N);
  {
    int Lj4PdHRW;
    int KL2GvlyY;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      for(KL2GvlyY=(0);KL2GvlyY<(N);KL2GvlyY++){
        rd(C[Lj4PdHRW][KL2GvlyY]);
      }
    }
  }
  pw[0] = 1;
  for(i=(0);i<(N);i++){
    pw[i+1] = pw[i] * 3;
  }
  for(i=(0);i<(N);i++){
    for(j=(0);j<(pw[N]);j++){
      dp[i][j] = 4611686016279904256LL;
    }
  }
  for(i=(0);i<(N);i++){
    dp[i][pw[i]] = 0;
  }
  for(mask=(0);mask<(pw[N]);mask++){
    for(p=(0);p<(N);p++){
      if(dp[p][mask] < 4611686016279904256LL){
        DigitF_L(mask, N, arr, 3);
        for(i=(0);i<(N);i++){
          if(!(p==i || arr[i]==2)){
            break;
          }
        }
        if(i==N){
          chmin(res, dp[p][mask]);
        }
        for(i=(0);i<(N);i++){
          if(p!=i && arr[i]<=1){
            chmin(dp[i][mask+pw[i]], dp[p][mask] + C[p][i]);
          }
        }
      }
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20201102-1

// --- original code ---
// int N; ll C[9][9];
// ll dp[9][20000], pw[10];
// int arr[10];
// {
//   int i, j, k, p;
//   ll res = ll_inf;
//   rd(N,C(N,N));
//   pw[0] = 1;
//   rep(i,N) pw[i+1] = pw[i] * 3;
//   rep(i,N) rep(j,pw[N]) dp[i][j] = ll_inf;
//   rep(i,N) dp[i][pw[i]] = 0;
//   rep(mask,pw[N]) rep(p,N) if(dp[p][mask] < ll_inf){
//     DigitF(mask, N, arr, 3);
//     rep(i,N) if(!(p==i || arr[i]==2)) break;
//     if(i==N) res <?= dp[p][mask];
//     // wt(p,":",arr(N),":",dp[p][mask],i);
//     rep(i,N) if(p!=i && arr[i]<=1) dp[i][mask+pw[i]] <?= dp[p][mask] + C[p][i];
//   }
//   wt(res);
// }