#include <cstdio>

#include <cstring>

#include <algorithm>

#include <vector>

#define MAXN 20

#define INF 0x3f3f3f3f

using namespace std;

int n;

int edges[MAXN][MAXN];

int dp[][MAXN];

int min(int a, int b)

{

    if (a == -) return b;

    if (b == -) return a;

    return a < b ? a : b;

}

int main()

{

    scanf("%d", &n);

    int t;

    for (int i = ; i < n; i++)

    {

        for (int j = ; j < n; j++)

        {

            scanf("%d", &edges[i][j]);

        }

    }

    memset(dp, -, sizeof(dp));

    for (int i = ; i < n; i++)

    {

        dp[ << i][i] = ;

    }

    int ans = -;

    for (int i = ; i <  << n; i++)

    {

        for (int j = ; j < n; j++)

        {

            if (dp[i][j] != -)

            {

                for (int k = ; k < n; k++)

                {

                    if (!(i & ( << k)))

                    {

                        dp[i | ( << k)][k] = min(dp[i | ( << k)][k], dp[i][j] + edges[j][k]);

                        if ((i | ( << k)) == ( << n) - ) ans = min(ans, dp[i | ( << k)][k]);

                    }

                }

            }

        }

    }

    if (ans != -)

        printf("%d\n", ans);

    else printf("0\n");

    return ;

}