n=int(input())
check=[list(map(int,input().split())) for _ in range(n)]
for i in range(n):
    tmp=0
    for j in range(n):
        if check[i][j]==1:
            tmp+=2**(n-1-j)
    check[i]=tmp
cost=list(map(int,input().split()))
ans=10**18
for i in range(0,2**n):
    flag=format(i,'b')
    s=set()
    for j in range(len(flag)):
        if flag[-(j+1)]=='1':
            s.add(n-1-j)
    for _ in range(n):
        for j in range(n):
            if j in s:
                continue
            if (~i)&check[j]==0:
                s.add(j)
    if len(s)==n:
        tmp=0
        for j in range(len(flag)):
            if flag[-(j+1)]=='1':
                tmp+=cost[n-1-j]
        ans=min(ans,tmp)
print(ans)