N = int(input())
F = [list(map(int,input().split())) for _ in range(N)]
P = [list(map(int,input().split())) for _ in range(N)]

ans = -9999999
for i in range(1,2**10):
    pfit = 0
    for j in range(N):  
        cnt = 0
        for k in range(10): 
            if (i >> k) & 1 == 1 and F[j][k] == 1:
                 cnt +=1 
        pfit += P[j][cnt]
    ans = max(ans,pfit)
print(ans)