import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto X = new long[][](N);
	foreach (i; 0..N)
		X[i] = RDA;
	auto A = RDA;

	long ans = long.max;
	foreach (i; 0..2^^N)
	{
		long cost;
		auto cnt = new long[](N);
		foreach (y; 0..N)
		{
			foreach (x; 0..N)
			{
				if (X[y][x] == 1)
				{
					++cnt[y];
				}
			}
		}
		void f(long jj)
		{
			foreach (ii; 0..N)
			{
				if (X[ii][jj] == 1 && cnt[ii] != 0)
				{
					--cnt[ii];
					if (cnt[ii] == 0)
					{
						f(ii);
					}
				}
			}
		}
		foreach (j; 0..N)
		{
			auto bit = 1L << j;
			if (i & bit)
			{
				cost += A[j];
				cnt[j] = 0;
				f(j);
			}
			else if (cnt[j] == 0)
				f(j);
		}
		bool ok = true;
		(){
		foreach (y; 0..N)
		{
			foreach (x; 0..N)
			{
				if (X[y][x] == 1 && cnt[x] != 0)
				{
					ok = false;
					return;
				}
			}
		}}();
		if (ok)
			ans.chmin(cost);
	}

	writeln(ans);
	stdout.flush;
	debug readln;
}