n = int(input())
b = [ int(''.join(list(reversed(input().replace(" ", "")))), 2) for i in range(n) ]
a = list(map(int, input().split()))
dp = [1 << 28] * (1 << n)
dp[0] = 0
for i in range(1 << n):
    for j in range(n):
        dp[i | 1 << j] = min(dp[i | 1 << j], dp[i] + (0 if (i & b[j]) == b[j] else a[j]))

print(dp[-1])