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

alias sread = () => readln.chomp();
ulong MOD = 1_000_000_007;
ulong INF = 1_000_000_000_000;

T lread(T = long)()
{
    return readln.chomp.to!T();
}

T[] aryread(T = long)()
{
    return readln.split.to!(T[])();
}

void scan(TList...)(ref TList Args)
{
    auto line = readln.split();
    foreach (i, T; TList)
    {
        T val = line[i].to!(T);
        Args[i] = val;
    }
}

void main()
{
    auto n = lread();
    auto shop = new long[][](n, 10);
    auto p = new long[][](n, 11);
    foreach (ref e; shop)
    {
        e = aryread();
    }
    foreach (ref e; p)
    {
        e = aryread();
    }
    long max_bene = -INF;
    foreach (i; iota(1, 1 << 10))
    {
        long bene;
        auto bitary = i.makebitary();
        foreach (j; iota(n))
        {
            long cnt;
            foreach (k; iota(10))
                cnt += shop[j][k] & bitary[k];

            bene += p[j][cnt];
        }
        max_bene = max(bene, max_bene);
    }
    max_bene.writeln();
}

auto makebitary(long a, long disit = 10)
{
    auto bits = new long[](disit);
    long i;
    while (a > 0)
    {
        bits[i++] = a % 2;
        a = a >> 1;
    }
    return bits;
}
