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

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
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;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto F = new uint[](N);
    auto P = new long[][](N);
    foreach (i; 0 .. N)
    {
        auto tmp = aryread!uint();
        foreach (j; 0 .. 10)
            F[i] = F[i] | (tmp[j] << j);
    }
    foreach (i; 0 .. N)
        P[i] = aryread();
    long eval(uint state)
    {
        long ret;
        foreach (i; 0 .. N)
        {
            ret += P[i][popcnt(state & F[i])];
        }
        return ret;
    }

    long ans = long.min;
    foreach (uint s; 1 .. (1 << 10))
    {
        ans = ans.max(eval(s));
    }
    writeln(ans);
}
