N=int(input())
D=[]
for i in range(N):
    D.append(list(map(int,input().split())))
for k in range(N):
    for i in range(N):
        for j in range(N):
            D[i][j] = min(D[i][j], D[i][k]+D[k][j])
inf = 10**18
dp = [[inf for _ in range(N)] for _ in range(2**N)]
dp[1][0] = 0
for i in range(2**N):
    bc = i.bit_count()
    for j in range(N):
        if (1<<j)&i == 0:
            continue
        for k in range(N):
            if (1<<k)&i == 0:
                dp[i^(1<<k)][k] = min(dp[i^(1<<k)][k],dp[i][j] + D[j][k]*(N-bc))
print(min(dp[-1]))