#include <bits/stdc++.h>
using namespace std;
const int INF = 2000000000;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> c(N, vector<int>(N));
  for (int i = 0; i < N; i++){
    for (int j = 0; j < N; j++){
      cin >> c[i][j];
    }
  }
  vector<vector<vector<int>>> dp(1 << N, vector<vector<int>>(1 << N, vector<int>(N, INF)));
  for (int i = 0; i < N; i++){
    dp[0][1 << i][i] = 0;
  }
  for (int i = 0; i < (1 << N); i++){
    for (int j = 0; j < (1 << N) - 1; j++){
      for (int k = 0; k < N; k++){
        if (dp[i][j][k] != INF){
          for (int l = 0; l < N; l++){
            if (!(j >> l & 1)){
              if (i >> k & 1){
                int j2 = j | (1 << l);
                dp[i][j2][l] = min(dp[i][j2][l], dp[i][j][k] + c[k][l]);
              } else {
                int i2 = i | (1 << k);
                int j2 = (j | (1 << l)) ^ (1 << k);
                dp[i2][j2][l] = min(dp[i2][j2][l], dp[i][j][k] + c[k][l]);
              }
            }
          }
        }
      }
    }
  }
  int ans = INF;
  for (int i = 0; i < (1 << N); i++){
    for (int j = 0; j < N; j++){
      ans = min(ans, dp[i][(1 << N) - 1][j]);
    }
  }
  cout << ans << endl;
}