#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<vector<int>> c(n, vector<int>(n)); REP(i, n) REP(j, n) cin >> c[i][j];
  int x = n * 2;
  vector dp(1 << x, vector(n, LINF));
  REP(i, n) dp[1 << (i * 2)][i] = 0;
  FOR(i, 1, 1 << x) {
    vector<int> state(n);
    REP(j, n) state[j] = i >> (j * 2) & 3;
    REP(j, n) {
      if (dp[i][j] == LINF || state[j] % 2 == 0) continue;
      int nx = i;
      if (state[j] == 1) nx ^= 3 << (j * 2);
      REP(k, n) {
        if (state[k] & 1) continue;
        chmin(dp[nx ^ (1 << (k * 2))][k], dp[i][j] + c[j][k]);
      }
    }
  }
  ll ans = LINF;
  REP(i, 1 << x) {
    bool is_white = true;
    REP(j, n) is_white &= i >> (j * 2) & 1;
    if (is_white) chmin(ans, *min_element(ALL(dp[i])));
  }
  cout << ans << '\n';
  return 0;
}