#!/usr/bin/env python3
# %%
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


# %%
N = int(readline())
XA = tuple(map(int, read().split()))
X = XA[:N * N]
A = XA[N * N:]

# %%
need_subset = [0] * N
for i in range(N):
    need_subset[i] = sum((1 << j) * x for j, x in enumerate(X[N * i:N * i + N]))


# %%
dp = list(range(1 << N))
full = (1 << N) - 1
for n in range(full, -1, -1):
    for i in range(N):
        if n & (1 << i):
            continue
        if n & need_subset[i] == need_subset[i]:
            dp[n] = dp[n ^ (1 << i)]
            break

# %%
cost = [0] * (1 << N)
for n in range(1, 1 << N):
    m = n & (-n)
    cost[n] = cost[n ^ m] + A[m.bit_length() - 1]

# %%
answer = cost[full]
for n in range(1 << N):
    if dp[n] == full:
        x = cost[n]
        if answer > x:
            answer = x
# %%
print(answer)