#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

inline int topbit(unsigned long long x){
	return x?63-__builtin_clzll(x):-1;
}

inline int popcount(unsigned long long x){
	return __builtin_popcountll(x);
}

inline int parity(unsigned long long x){//popcount%2
	return __builtin_parity(x);
}



template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e18;

int main(){
    ll n;
    cin >> n;
    vector<vector<ll>> c(n,vector<ll>(n));
    rep(i,n) rep(j,n){
        cin >> c[i][j];
    }
    ll ans=INF;
    vector<vector<ll>> dp(1<<(2*n),vector<ll>(2*n,INF));
    rep(i,n){
        dp[(1<<i)][i]=0;
    }
    for(ll s=1;s<(1<<(2*n));s++){
        rep(t,2*n){
            if((s>>t)%2==0) continue;
            rep(u,2*n){
                if((s>>u)%2==0) continue;
                if(t==u) continue;
                if(t%n==u%n) continue;
                dp[s][u]=min(dp[s][u],dp[s^(1<<u)][t]+c[t%n][u%n]);
            }
        }
    }
    ll all=(1<<(2*n));
    rep(i,n){
        ans=min(ans,dp[all-1][i]);
        ans=min(ans,dp[all-1][i+n]);
        ans=min(ans,dp[(all-1)^(1<<i)][i]);
        ans=min(ans,dp[(all-1)^(1<<(i+n))][i]);
        ans=min(ans,dp[(all-1)^(1<<i)][i+n]);
        ans=min(ans,dp[(all-1)^(1<<(i+n))][i+n]);
    }
    cout << ans << endl;
    return 0;
}