#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;cin >> n;
    vector<vector<int>> c(n,vector<int>(n));
    REP(i,n) REP(j,n) cin >> c[i][j];
    vector<vector<ll>> dp(1<<(2*n),vector<ll>(n,INF));
    REP(i,n){
        dp[1<<(2*i)][i]=0;
    }
    REP(t,1<<(2*n)){
        vector<int> b(n);
        REP(i,n){
            b[i]=((t>>(2*i))&1)+((t>>(2*i+1))&1)*2;
        }
        REP(i,n){
            if(dp[t][i]==INF) continue;
            REP(j,n){
                if(b[j]&1) continue;
                if(b[i]==1){
                    chmin(dp[t+(1<<(2*i))+(1<<(2*j))][j],dp[t][i]+c[i][j]);
                }
                else{
                    chmin(dp[t+(1<<(2*j))][j],dp[t][i]+c[i][j]);
                }
            }
        }
    }
    ll ans=INF;
    REP(t,(1<<(2*n))){
        REP(j,n){
            bool f=true;
            REP(i,n){
                int b=((t>>(2*i))&1)+((t>>(2*i+1))&1)*2;
                if(b%2==0) f=false;
            }
            if(f) chmin(ans,dp[t][j]);
        }
    }
    cout << ans << endl;
}