#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (ll i = (ll)s; i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)

#define TT template <typename T>
template <class T1, class T2>
bool chmin(T1& x, T2 y) { return x > y ? (x = y, true) : false; }
template <class T1, class T2>
bool chmax(T1& x, T2 y) { return x < y ? (x = y, true) : false; }

struct io_setup {
    io_setup() {
        ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
        cout << fixed << setprecision(15);
        srand(time(NULL));
    }
} io_setup;

const ll INF = 1LL << 60;

void solve() {
    int N;
    cin >> N;
    vector D(N, vector<ll>(N));
    rep(i, 0, N) rep(j, 0, N) cin >> D[i][j];
    vector dp(1 << N, vector<ll>(N, INF));
    dp[1][0] = 0;
    rep(bit, 1, 1 << N) {
        vector<int> V, W;
        rep(i, 0, N) {
            if (bit >> i & 1) V.push_back(i);
            else W.push_back(i);
        }
        for (auto i : V) {
            for (auto j : W) {
                chmin(dp[bit ^ (1 << j)][j], dp[bit][i] + (ll)W.size() * D[i][j]);
            }
        }
    }
    ll ans = INF;
    rep(i, 0, N) chmin(ans, dp[(1 << N) - 1][i]);
    cout << ans << "\n";
}

int main() {
    solve();
}