n = int(input()) 
f = [list(map(int, input().split())) for i in range(n)] 
p = [list(map(int, input().split())) for j in range(n)] 

ans = -9999999999

for i in range(1, 1024): 
    bf = 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 
        bf += p[j][cnt] 
    ans =max(ans, bf)  　
    
print(ans)