#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr lint B1 = 1532834020;
constexpr lint M1 = 2147482409;
constexpr lint B2 = 1388622299;
constexpr lint M2 = 2147478017;
constexpr int INF = 2147483647;
void yes(bool expr) {cout << (expr ? "Yes" : "No") << "\n";}
template<class T>void chmax(T &a, const T &b) { if (a<b) a=b; }
template<class T>void chmin(T &a, const T &b) { if (b<a) a=b; }
int main()
{
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int N;
  cin >> N;
  vector<vector<lint>> c(N, vector<lint>(N));
  REP(i, N) REP(j, N) cin >> c[i][j];
  vector<vector<vector<lint>>> dp(1<<N, vector<vector<lint>>(1<<N, vector<lint>(N, 1e18)));
  set<tuple<lint, lint, lint, lint>> st;
  REP(i, N) {
    dp[1<<i][0][i] = 0;
    st.insert(make_tuple(0, 1<<i, 0, i));
  }
  while(!st.empty()) {
    auto tp = *st.begin();
    st.erase(tp);
    lint d = get<0>(tp);
    int bit1 = get<1>(tp);
    int bit2 = get<2>(tp);
    int last = get<3>(tp);
    REP(i, N) {
      if(bit1>>i&1) continue;
      if(bit2>>last&1) {
        if(d+c[last][i] < dp[bit1^(1<<i)][bit2][i]) {
          dp[bit1^(1<<i)][bit2][i] = d+c[last][i];
          st.insert(make_tuple(dp[bit1^(1<<i)][bit2][i], bit1^(1<<i), bit2, i));
        }
      } else {
        if(d+c[last][i] < dp[bit1^(1<<i)^(1<<last)][bit2^(1<<last)][i]) {
          dp[bit1^(1<<i)^(1<<last)][bit2^(1<<last)][i] = d+c[last][i];
          st.insert(make_tuple(dp[bit1^(1<<i)^(1<<last)][bit2^(1<<last)][i], bit1^(1<<i)^(1<<last), bit2^(1<<last), i));
        }
      }
    }
  }
  lint ans = 1e18;
  REP(j, 1<<N) REP(k, N) chmin(ans, dp[(1<<N)-1][j][k]);
  cout << ans << endl;
}