#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; int dx[4]={1,-1,0,0}; int dy[4]={0,0,1,-1}; templatebool chmax(T &a, const T &b) {if(abool chmin(T &a, const T &b) {if(b> n; Z[0]=1; rep(i,n){ Z[i+1]=Z[i]*3; rep(j,n){ cin >> c[i][j]; } } rep(S,Z[n]){ rep(i,n) dp[S][i]=INF; } rep(i,n){ dp[Z[i]][i]=0; } Rep(S,1,Z[n]){ rep(i,n){ rep(j,n){ if(i==j) continue; if(get(S,j)==0){ chmin(dp[S+Z[j]][j],dp[S][i]+c[i][j]); } else if(get(S,j)==1){ chmin(dp[S+Z[j]][j],dp[S][i]+c[i][j]); } } } } ll ans=INF; rep(i,n) chmin(ans,dp[Z[n]-1][i]); rep(i,n){ rep(j,n){ chmin(ans,dp[Z[n]-1-2*Z[i]][j]+c[j][i]); } } cout << ans << endl; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }