#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;
  ll C[N][N];

  for (int i = 0; i < N; ++i) {
    for (int j = 0; j < N; ++j) {
      cin >> C[i][j];
    }
  }

  int L = (1 << (2 * N));
  ll dp[L][2 * N];
  memset(dp, -1, sizeof(dp));

  for (int i = 0; i < N; ++i) {
    int nmask = 1 << i;
    dp[nmask][i] = 0;
  }

  for (int mask = 0; mask < L; ++mask) {
    for (int i = 0; i < N; ++i) {
      if (dp[mask][i] == -1) continue;

      for (int j = 0; j < N; ++j) {
        if (i == j) continue;
        if (mask >> j & 1) continue;

        int nmask = mask | (1 << j);
        ll ncost = dp[mask][i] + C[i][j];

        if (dp[nmask][j] == -1 || dp[nmask][j] > ncost) {
          dp[nmask][j] = ncost;
        }
      }

      for (int j = 0; j < N; ++j) {
        if (i == j) continue;
        if ((mask >> j & 1) == 0) continue;
        if (mask >> (j + N) & 1) continue;

        int nmask = mask | (1 << (j + N));
        ll ncost = dp[mask][i] + C[i][j];

        if (dp[nmask][j] == -1 || dp[nmask][j] > ncost) {
          dp[nmask][j] = ncost;
        }
      }
    }
  }

  ll ans = LLONG_MAX;

  for (int mask = 0; mask < L; ++mask) {
    int lmask = mask >> N;
    if (__builtin_popcount(lmask) != N - 1) continue;

    for (int i = 0; i < N; ++i) {
      if (dp[mask][i] == -1) continue;
      if (lmask >> i & 1) continue;

      ans = min(ans, dp[mask][i]);
    }
  }

  for (int i = 0; i < N; ++i) {
    ans = min(ans, dp[L - 1][i]);
  }

  cout << ans << endl;

  return 0;
}