import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T = string)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto N = RD!long;
	
	auto F_bit = new ulong[](N);
	foreach (i; 0..N)
	{
		auto F = RDR.split.to!(ulong[]);
		foreach (j, e; F)
		{
			F_bit[i] |= e << j;
		}
	}
	long[][] P;
	foreach (i; 0..N)
	{
		P ~= RDR.split.to!(long[]);
	}

	long ans = long.min;
	foreach (i; 1..0b10_000_000_000)
	{
		long income;
		foreach (j; 0..N)
		{
			auto bit = F_bit[j] & i;
			auto cnt = popcnt(cast(uint)bit);
			income  += P[j][cnt];
		}
		ans = max(ans, income);
	}

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