output_description: Print the maximum possible profit of Joisino's shop.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      F_{1,1,1} F_{1,1,2} ... F_{1,5,1} F_{1,5,2}
      :
      F_{N,1,1} F_{N,1,2} ... F_{N,5,1} F_{N,5,2}
      P_{1,0} ... P_{1,10}
      :
      P_{N,0} ... P_{N,10}
attempt: import sys
  import itertools
  
  
  def solve():
      readline = sys.stdin.buffer.readline
      mod = 10 ** 9 + 7
      n = int(readline())
      f = [list(map(int, readline().split())) for _ in range(n)]
      p = [list(map(int, readline().split())) for _ in range(n)]
      mt = - (10 ** 10)
      for it in itertools.product([True, False], repeat=10):
          if sum(it) != 0:
              ls = [0] * n(n):
                      ls[j] += 1 if f[j][i] == 1 and iv else 0
              t = 0
              for i in range(n):
                  t += p[i][ls[i]]
              mt = max(mt, t)
      print(mt)
  
  
  if __name__ == '__main__':
      solve()
  
problem_description: Statement
  
  Joisino is planning to open a shop in a shopping street.
  
  Each of the five weekdays is divided into two periods, the morning and the
  evening. For each of those ten periods, a shop must be either open during the
  whole period, or closed during the whole period. Naturally, a shop must be
  open during at least one of those periods.
  
  There are already N stores in the street, numbered 1 through N.
  
  You are given information of the business hours of those shops, F_{i,j,k}. If
  F_{i,j,k}=1, Shop i is open during Period k on Day j (this notation is
  explained below); if F_{i,j,k}=0, Shop i is closed during that period. Here,
  the days of the week are denoted as follows. Monday: Day 1, Tuesday: Day 2,
  Wednesday: Day 3, Thursday: Day 4, Friday: Day 5. Also, the morning is denoted
  as Period 1, and the afternoon is denoted as Period 2.
  
  Let c_i be the number of periods during which both Shop i and Joisino's shop
  are open. Then, the profit of Joisino's shop will be
  P_{1,c_1}+P_{2,c_2}+...+P_{N,c_N}.
  
  Find the maximum possible profit of Joisino's shop when she decides whether
  her shop is open during each period, making sure that it is open during at
  least one period.
samples: [{"input": "1\n    1 1 0 1 0 0 0 1 0 1\n    3 4 5 6 7 8 9 -2 -3 4 -2", "output": "8\n    \n\nIf her shop is open only during the periods when Shop 1 is opened, the profit\nwill be 8, which is the maximum possible profit.\n\n* * *"}, {"input": "2\n    1 1 1 1 1 0 0 0 0 0\n    0 0 0 0 0 1 1 1 1 1\n    0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1\n    0 -2 -2 -2 -2 -2 -1 -1 -1 -1 -1", "output": "-2\n    \n\nNote that a shop must be open during at least one period, and the profit may\nbe negative.\n\n* * *"}, {"input": "3\n    1 1 1 1 1 1 0 0 1 1\n    0 1 0 1 1 1 1 0 1 0\n    1 0 1 1 0 1 0 1 0 1\n    -8 6 -2 -8 -8 4 8 7 -6 2 2\n    -9 2 0 1 7 -5 0 -2 -6 5 5\n    6 -6 7 -9 6 -5 8 0 -9 -7 -7", "output": "23"}]