//#define _GLIBCXX_DEBUG #include #define rep(i, n) for(int i=0; i; using vs = vector; using vi = vector; using vvi = vector; template using PQ = priority_queue; template using PQG = priority_queue, greater >; const int INF = 0xccccccc; const ll LINF = 0xcccccccccccccccLL; template inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);} template inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);} template istream &operator>>(istream &is, pair &p) { return is >> p.first >> p.second;} template ostream &operator<<(ostream &os, const pair &p) { return os << p.first << ' ' << p.second;} #undef _GLIBCXX_DEBUG string to_string(const string &s) {return '"' + s + '"';} string to_string(const char *s) {return to_string(string(s));} string to_string(bool b) {return b?"true":"false";} string to_string(vector v) { string res = "{"; for(int i = 0; i < int(v.size()); i++) { if(i) res += ", "; res += to_string(v[i]); } res += "}"; return res; } template string to_string(bitset v) { string res; for(size_t i = 0; i < N; i++) res += char('0' + v[i]); return res; } template string to_string(pair); template string to_string(tuple); template string to_string(tuple); template string to_string(A v) { bool first = true; string res = "{"; for(const auto &x:v) { if(!first) res += ", "; first = false; res += to_string(x); } res += "}"; return res; } template string to_string(pair p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; } template string to_string(tuple t) { return "(" + to_string(get<0>(t)) + ", " + to_string(get<1>(t)) + ", " + to_string(get<2>(t)) + ")"; } template string to_string(tuple t) { return "(" + to_string(get<0>(t)) + ", " + to_string(get<1>(t)) + ", " + to_string(get<2>(t)) + ", " + to_string(get<3>(t)) + ")"; } void debug_out() {cerr << endl;} template void debug_out(Head H, Tail... T) { cerr << ' ' << to_string(H); debug_out(T...); } #ifdef LOCAL #define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__) #else #define debug(...) 822 #endif //head int num(vi &u) { int res = 0; for(auto x:u) { res *= 3; res += x; } return res; } vi _num(int num, int n) { vi res(n); for(int i = n-1; i >= 0; i--) { res[i] = num%3; num /= 3; } return res; } int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; int nn = 1; rep(i, n) nn *= 3; vvi c(n+1, vi(n)); rep(i, n) rep(j, n) cin >> c[i][j]; vector> dp(nn, vector(n+1, LINF)); auto dfs = [&](auto self, int id, int pre)->ll{ ll &res = dp[id][pre]; if(res != LINF) return res; auto vec = _num(id, n); bool flg = false; rep(i, n) if(i != pre and vec[i] != 2) flg = true; if(!flg) { return res = 0; } rep(i, n) { if(pre == i or vec[i] == 2) continue; vec[i]++; int u = num(vec); vec[i]--; chmin(res, self(self, u, i)+c[pre][i]); } return res; }; cout << dfs(dfs, 0, n) << endl; }