N = int(input())
D = [list(map(int,input().split())) for _ in range(N)]

INF = 10**18
dp = [[INF for _ in range(N)] for _ in range(1<<N)]
dp[1][0] = 0
for i in range(1<<N):
    for j in range(N):
        if(i>>j & 1 == 0):continue        
        if(dp[i][j] == INF):continue
        for k in range(N):
            if(i>>k & 1 == 1):continue
            dp[i | (1<<k)][k] = min(dp[i | (1<<k)][k], dp[i][j] + D[j][k])

dp2 = [[INF for _ in range(N)] for _ in range(1<<N)]
dp2[1][0] = 0
for i in range(1<<N):
    for j in range(N):
        if(i>>j & 1 == 0):continue
        if(dp[i][j] == INF):continue
        for k in range(N):
            if(i>>k & 1 == 1):continue
            dp2[i | (1<<k)][k] = min(dp2[i | (1<<k)][k], dp2[i][j] + dp[i | (1<<k)][k])

print(min(dp2[-1]))