#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <functional>

typedef long long int ll;
using namespace std;
#define INF 0x7FFFFFFF
#define N 200000

const int LIMIT = 1e+9;
int n, m;
long long value[20][20], dp[20][(1 << 16) + 5];

int solve(int current, int visited) {
	if (visited == ((1 << n) - 1)) {
		if (value[current][0] != 0) {
			return value[current][0];
		}
		else {
			return INF;
		}
	}
	long long& res = dp[current][visited];
	if (res != INF) {
		return res;
	}

	for (int i = 0; i < n; i++) {
		if (!(visited & (1 << i)) && value[current][i] != 0) {
			res = min(res, value[current][i] + solve(i, visited | (1 << i)));
		}
	}
	return res;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	memset(dp, INF, sizeof(dp));

	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			cin >> value[i][j];
		}
	}
	for(int i=0; i<n; i++){
		for (int j = 0; j < (1 << 16); j++) {
			dp[i][j] = INF;
		}
	}

	cout << solve(0, 1);


	return 0;
}