// Template
#include "bits/stdc++.h"
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep3(i, l, r) for (int i = (int)(l); i < (int)(r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
constexpr int inf = 1001001001;
constexpr ll INF = 3003003003003003003LL;
template <typename T>
inline bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T> 
inline bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}
struct IOSET {
    IOSET() {
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(10);
    }
} ioset;
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
    for (T &element : vec) is >> element;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
    for (int i = 0, vec_len = (int)vec.size(); i < vec_len; ++i) {
        os << vec[i] << " \n"[i + 1 == vec_len];
    }
    return os;
}

// Main
int main() {
    int n;
    cin >> n;
    vector<vector<int>> c(n, vector<int>(n));
    cin >> c;
    
    auto ed = [&](bitset<18> bs) -> bool {
        rep(i, n) {
            if (bs[2 * i] == 0) return false;
        }
        return true;
    };
    
    vector<vector<int>> memo(1 << (2 * n), vector<int>(n, -1));
    auto rec = [&](auto self, bitset<18> bs, int s) -> int {
        if (ed(bs)) return 0;
        if (memo[bs.to_ulong()][s] != -1) return memo[bs.to_ulong()][s];
        int res = INT_MAX;
        rep(i, n) {
            if (i == s) continue;
            if (bs[2 * i]) continue;
            bs[2 * i] = 1;
            if (bs[2 * s] == 1 && bs[2 * s + 1] == 0) {
                bs[2 * s] = 0;
                bs[2 * s + 1] = 1;
            }
            chmin(res, self(self, bs, i) + c[s][i]);
            bs[2 * i] = 0;
            if (bs[2 * s] == 0 && bs[2 * s + 1] == 1) {
                bs[2 * s] = 1;
                bs[2 * s + 1] = 0;
            }
        }
        return memo[bs.to_ulong()][s] = res;
    };
    int ans = INT_MAX;
    rep(i, n) {
        bitset<18> bs(0);
        bs[2 * i] = 1;
        chmin(ans, rec(rec, bs, i));
    }
    cout << ans << "\n";
}