n = int(input())

counton = [0]*n
for i in range(n):
    b = input().split()
    for j in range(n):
            counton[i] += 1<<j if b[j]=="1" else 0

a = list(map(int, input().split()))

ans = sum(a)

for i in range(2**n):
    tmp = 0
    for j in range(n):
        tmp += a[j] if ((i>>j)&1) == 1 else 0
    
    # 高速化出来る
    if tmp >= ans:
        continue

    lie, confess, k = i, 0, -1
    while k+1 < n:
        k += 1
        if ((confess>>k)&1) == 1:
            continue
        if (lie&counton[k]) == counton[k]:
            confess |= 1<<k
            lie |= 1<<k
            k = -1
    
    if confess == (1<<n)-1:
        ans = tmp

print(ans)