n = int(input())
D = [list(map(int, input().split())) for _ in range(n)]
inf = 1 << 30
N = 1 << n
dp = [[inf for _ in range(n)] for _ in range(N)]
dp[1][0] = 0
for bit in range(N):
    cnt = n-bin(bit).count("1")
    for now in range(n):
        if not bit >> now & 1:
            continue
        for nxt in range(n):
            if bit >> nxt & 1:
                continue
            dp[bit|1<<nxt][nxt] = min(dp[bit|1<<nxt][nxt], dp[bit][now] + D[now][nxt] * cnt)

ans = min(dp[-1])
print(ans)