#include <bits/stdc++.h> using namespace std; int n; int step = 0; int used[20] = { 0 }; int s[20][20]; int ans = INT_MAX; void dfs(int u, int last, int step) { if (step > ans) return; if (u == n - 1) { step += s[last][1]; ans = min(ans, step); return; } for (int i = 2; i <= n; i++) { if (!used[i]) { used[i] = 1; dfs(u + 1, i, step + s[last][i]); used[i] = 0; } } } int main() { cin >> n; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) cin >> s[i][j]; } dfs(0, 1, 0); cout << ans; return 0; }