#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int n;
ll c[10][10];

const ll INF = 1e18;
ll dp[1<<18][9];

void input(){
    cin >> n;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            cin >> c[i][j];
        }
    }
}

void init_dp(){
    for(int i = 0; i < (1<<(2*n)); i++){
        for(int j = 0; j < n; j++){
            dp[i][j] = INF;
        }
    }
}

void solve(){
    init_dp();
    for(int i = 0; i < n; i++){
        dp[1<<i][i] = 0;
    }
    // l: Bのひっくり返し状況
    for(int l = 0; l < (1<<n); l++){
        // r: 盤面の状態
        for(int r = 0; r < (1<<n); r++){
            int m = (l<<n)+r;
            for(int p = 0; p < n; p++){
                for(int q = 0; q < n; q++){
                    if((1<<q)&r) continue;
                    if(!((1<<p)&r)) continue;
                    // cout << dp[m][p] << '-';
                    int next_m = 0;
                    // すでにpをひっくり返している
                    if(l&(1<<p)){
                        next_m = (l<<n)+(r+(1<<q));
                    // まだ
                    }else{
                        next_m = ((l+(1<<p))<<n)+(r+(1<<q)-(1<<p));
                    }
                    // cout << dp[next_m][q] << '-';
                    dp[next_m][q] = min(dp[next_m][q], dp[m][p]+c[p][q]);
                    // cout << l << ' ' << r << ' ' << p << ' ' << q << ' ' << dp[next_m][q] << endl;
                }
            }
        }
    }
    ll ans = INF;
    int full_bit = (1<<n)-1;
    for(int l = 0; l < (1<<n); l++){
        for(int p = 0; p < n; p++){
            ans = min(ans, dp[(l<<n)+full_bit][p]);
        }
    }
    cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    input();
    solve();
}