// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint1000000007;
// using mint = modint998244353;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define rrep(i, n) for (int i = (int)n-1; i >= 0; --i)
using namespace std;
using ll = long long;
template<typename T>
inline bool chmax(T& a, const T& b) {
    if (a < b){
        a = b;
        return true;
    }
    return false;
}
template<typename T>
inline bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}
/**
 * @brief 多次元 vector の作成
 * @author えびちゃん
 */
namespace detail {
    template<typename T, int N>
    auto make_vec(vector<int>& sizes, T const& x) {
        if constexpr (N == 1) {
            return vector(sizes[0], x);
        } else {
            int size = sizes[N-1];
            sizes.pop_back();
            return vector(size, make_vec<T, N-1>(sizes, x));
        }
    }
}
template<typename T, int N>
auto make_vec(int const(&sizes)[N], T const& x = T()) {
    vector<int> s(N);
    for (int i = 0; i < N; ++i) s[i] = sizes[N-i-1];
    return detail::make_vec<T, N>(s, x);
}
__attribute__((constructor))
void fast_io() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

int main() {
    int n;
    cin >> n;
    auto c = make_vec<int>({n, n});
    rep(i, n) rep(j, n) cin >> c[i][j];

    auto dp = make_vec<ll>({1<<(2*n), n}, LLONG_MAX);
    using T = tuple<ll, int, int>;
    priority_queue<T, vector<T>, greater<T>> pq;
    rep(i, n) {
        dp[1<<i][i] = 0;
        pq.emplace(0, 1<<i, i);
    }
    while (!pq.empty()) {
        auto [cost, bit, i] = pq.top();
        pq.pop();
        if (dp[bit][i] < cost) continue;
        rep(j, n) {
            if (bit>>j & 1) continue;
            int nbit = bit | (1<<j);
            if (!(bit>>(i+n) & 1)) {
                nbit |= 1<<(i+n);
                nbit &= ~(1<<i);
            }
            ll ncost = cost + c[i][j];
            if (chmin(dp[nbit][j], ncost)) pq.emplace(ncost, nbit, j);
        }
    }

    ll ans = LLONG_MAX;
    rep(i, 1<<(2*n)) rep(j, n) {
        bool ok = true;
        rep(k, n) {
            if (i>>k & 1) continue;
            ok = false;
            break;
        }
        if (ok) chmin(ans, dp[i][j]);
    }

    cout << ans << '\n';
}