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

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