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

INF = 1<<60

dp = [[INF]*N for _ in range(1<<N)]
dp[1][0] = 0
cnt = [N-bit.bit_count()+1 for bit in range(1<<N)]
for bit in range(1<<N):
    for i in range(N):
        if dp[bit][i] == INF:
            continue
        for j in range(N):
            if 1<<i & bit and not 1<<j & bit:
                dp[bit|1<<j][j] = min(dp[bit|1<<j][j], dp[bit][i]+D[i][j]*cnt[bit|1<<j])

print(min(dp[-1]))