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

template <class T> bool chmin(T& x, T y) {
	return x > y ? (x = y, true) : false;
}
template <class T> bool chmax(T& x, T y) {
	return x < y ? (x = y, true) : false;
}

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

void solve() {
	int n;
	cin >> n;
	vector d(n, vector<int>(n));
	rep(i, 0, n) rep(j, 0, n) cin >> d[i][j];
	vector dp(n, vector<array<int, 2>>(1 << n, {(int)1e9, (int)1e9}));
	dp[0][1] = {0, 0};
	rep(bit, 0, 1 << n) rep(i, 0, n) {
		if (dp[i][bit][0] == 1e9) continue;
		auto [t, s] = dp[i][bit];
		rep(j, 0, n) if ((~bit >> j) & 1) {
			chmin(dp[j][bit | (1 << j)], {t + d[i][j], s + t + d[i][j]});
		}
	}
	int ans = 1e9;
	rep(i, 0, n) {
		auto [t, s] = dp[i].back();
		chmin(ans, s);
	}
	cout << ans << '\n';
}

int main() {
	int t = 1;
	// cin >> t;
	while (t--) solve();
}