N = int(input())
c = [0]*N
for i in range(N):
    X = list(map(int, input().split()))
    for j in range(N):
        c[i] ^= X[j]*(1<<j)
A = list(map(int, input().split()))
cost = [0]*(1<<N)
for i in range(1<<N):
    cc = 0
    for j in range(N):
        if i&(1<<j):
            cc += A[j]
    cost[i] = cc
res = float('inf')
for i in range(1<<N):
    bit = i
    for j in range(N):
        cnt = 0
        for k in range(N):
            if c[k]&bit==c[k]:
                cnt += 1
                bit |= 1<<k
        if cnt==N:
            res = min(res, cost[i])
            break
print(res)