#include<iostream>
using namespace std;double f[5][7] = {0};
int a[5] = {0,2,3,2,4};
int main()
{for(int i=0;i<5;i++)for(int j=0;j<=7;j++)f[i][j] = 1000;f[5][0] = 0;for (int i=4;i>=1;i--){for(int s=0;s<=6;s++) {int temp = 0;for(int k=i;k<=4;k++) temp+= a[k];if (s>temp) continue;double min = 10000;int u = -1;for(int j=0;j<=6;j++){int w = 3 + j;if (j==0) w = 0;if (s + j - a[i] >= 0 && s + j - a[i] <=6) {if (min>f[i+1][s+j-a[i]] + w + 0.5*s) {min = f[i+1][s+j-a[i]] + w + 0.5*s;u = j;}}}f[i][s] = min;}}cout<<"Answer:"<<f[1][0]<<endl;return 0;
}

#include<iostream>
#include<stdio.h>
#include<algorithm>
using namespace std;
const int maxnum = 100001;int Count(int v){int num = 0;while(v){v &= (v-1);num ++;}return num;
}bool cmp(int a , int b){int count1_a = Count(a);int count1_b = Count(b);return count1_a < count1_b;
}bool existkey( int key , int S) {int p = 1;p = p << (key-1);p = p & S;if (p>0) return true;else return false;
}void getElements( int S , int * arr , int length , int &return_len) {int p = 1;int pos = 0;for(int i=0;i<length;i++){if (p == (p&S)){arr[pos++] = i+1;}p = p << 1;}return_len = pos;
}int main()
{freopen("input.txt","r",stdin);int n = 0 ;cin >> n;int F[10][100];int S[1000];int elements [10];int distance[10][10];int length_elements = 0;for(int i=0 ; i<n ; i++ ){for (int j=0 ; j<n ; j++) {cin>>distance[i][j];}}for (int i=1 ; i<=n ;i++)F[i][0] = distance[i][0];int length = (1 << (n-1)) - 1;for (int i=1 ; i<=length ; i++){S[i] = i;}sort(S,S+length,cmp);S[0] = 0;for (int j=1 ; j<=length ; j++) {for(int i=1 ; i<n ; i++) {if (existkey(i , S[j]) != true){ getElements(S[j] , elements, n , length_elements);int min = maxnum;for (int p=0 ; p<length_elements ; p++){int k = elements[p];int jj = S[j] & (length-(1<<(k-1))) ;if (min > ( F[k][jj] + distance[i][k] ) && k!=i )min = F[k][jj] + distance[i][k];}F[i][S[j]] = min;}}}int ans = maxnum;for (int i=1 ; i<n ; i++){int j = length & (length -(1<<(i-1)));if (ans > F[i][j] + distance[0][i]) ans = F[i][j] + distance[0][i];}cout<<"Answer:\t"<<ans<<endl;return 0;
}