package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"strconv"
)

func configure(scanner *bufio.Scanner) {
	scanner.Split(bufio.ScanWords)
	scanner.Buffer(make([]byte, 1000005), 1000005)
}
func getNextString(scanner *bufio.Scanner) string {
	scanned := scanner.Scan()
	if !scanned {
		panic("scan failed")
	}
	return scanner.Text()
}
func getNextInt(scanner *bufio.Scanner) int {
	i, _ := strconv.Atoi(getNextString(scanner))
	return i
}
func getNextInt64(scanner *bufio.Scanner) int64 {
	i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)
	return i
}
func getNextFloat64(scanner *bufio.Scanner) float64 {
	i, _ := strconv.ParseFloat(getNextString(scanner), 64)
	return i
}
func main() {
	fp := os.Stdin
	wfp := os.Stdout
	extra := 0
	if os.Getenv("I") == "IronMan" {
		fp, _ = os.Open(os.Getenv("END_GAME"))
		extra = 100
	}
	scanner := bufio.NewScanner(fp)
	configure(scanner)
	writer := bufio.NewWriter(wfp)
	defer func() {
		r := recover()
		if r != nil {
			fmt.Fprintln(writer, r)
		}
		writer.Flush()
	}()
	solve(scanner, writer)
	for i := 0; i < extra; i++ {
		fmt.Fprintln(writer, "-----------------------------------")
		solve(scanner, writer)
	}
}
func solve(scanner *bufio.Scanner, writer *bufio.Writer) {
	n := getNextInt(scanner)
	xx := make([]uint32, n)
	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			x := getNextInt(scanner)
			if x == 0 {
				continue
			}
			xx[i] = xx[i] | (1 << uint(j))
		}
	}
	aa := make([]int, n)
	for i := 0; i < n; i++ {
		aa[i] = getNextInt(scanner)
	}
	var ans int
	ans = math.MaxInt32
	for b := 0; b < 1<<uint(n); b++ {
		lie := 0
		for i := 0; i < n; i++ {
			if b>>uint(i)&1 == 0 {
				continue
			}
			lie += aa[i]
		}
		bb := uint32(b)
		for i := 0; i < n; i++ {
			for j := 0; j < n; j++ {
				if xx[j]&bb == xx[j] {
					bb = bb | 1<<uint(j)
				}
			}
		}
		if int(bb)+1 < 1<<uint(n) {
			continue
		}
		if ans > lie {
			ans = lie
		}
	}
	fmt.Fprintln(writer, ans)
}
func makeGrid(h, w int) [][]int {
	index := make([][]int, h, h)
	data := make([]int, h*w, h*w)
	for i := 0; i < h; i++ {
		index[i] = data[i*w : (i+1)*w]
	}
	return index
}