import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
dij = [(0, 1), (1, 0), (1, 1), (1, -1)]
inf = 10**19
# md = 998244353
md = 10**9+7

n = II()
ss = []
for _ in range(n):
    s = SI()
    s = s.replace(" ", "")
    ss.append(int(s[::-1], 2))
aa = LI()

def chmin(bit, val):
    if val < dp[bit]: dp[bit] = val

dp = [inf]*(1 << n)
dp[0] = 0
for bit in range(1 << n):
    pre = dp[bit]
    for i, s in enumerate(ss):
        if bit >> i & 1: continue
        nbit = bit | 1 << i
        if s & bit == s: chmin(nbit, pre)
        else: chmin(nbit, pre+aa[i])

print(dp[-1])