#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,0,1,-1,1,1,-1,-1,0};
const ll dx[9]={1,-1,0,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


int main(){
  ll n;cin >> n;
  vvl g(n,vl(n));rep(i,n)rep(j,n)cin >> g[i][j];
  ll dp[1<<(n*2)][n];
  rep(i,1<<(n*2))rep(j,n)dp[i][j]=INF;
  rep(i,n){
    dp[1<<i][i]=0;
  }
  ll ans=INF;
  rep(bit,1<<(n*2)){
    rep(j,n){
      vector<bool> fl(n,false);
      ll check=-1;
      rep(k,n){
        if(bit&(1<<(k+n)))fl[k]=true;
      }
      rep(k,n){
        if(fl[k]==false&&check==-1)check=k;
        else if(fl[k]==false)check=-2;
      }
      rep(k,n){
        if(j==k)continue;
        if(!(bit&(1<<k))){
          chmin(dp[bit|(1<<k)][k],dp[bit][j]+g[j][k]);
          if(check==k)chmin(ans,dp[bit][j]+g[j][k]);
        }
        else if(!(bit&(1<<(k+n)))){
          chmin(dp[bit|(1<<(k+n))][k],dp[bit][j]+g[j][k]);
        }
      }
    }
  }
  rep(i,n)chmin(ans,dp[(1<<(n*2))-1][i]);
  cout << ans <<endl;
}