#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vd = vector<double>;
using vvd = vector<vd>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vs = vector<string>;
const int INF = (1 << 30) - 1;
const ll INF64 = ((ll)1 << 62) - 1;
const double PI = 3.1415926535897932384626433832795;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
int gcd(int x, int y) { return y ? gcd(y, x % y) : x; }
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int lcm(int x, int y) { return x / gcd(x, y) * y; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  ll n;
  cin >> n;
  vvl f(n, vl(5));
  vvl f2(n, vl(5));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 5; j++) {
      cin >> f[i][j] >> f2[i][j];
    }
  }
  vvl p(n, vl(11));
  for (int i = 0; i < n; i++) {
    for (int j = 0; j <= 10; j++) {
      cin >> p[i][j];
    }
  }
  ll res = 0;
  ll ma = -INF;
  ll mi = INF;
  for (int i = 0; i < n; i++) {
    int maCnt = 0;
    for (int j = 0; j < 5; j++) {
      if (f[i][j] && f2[i][j]) {
        maCnt += 2;
      } else if (f[i][j] || f2[i][j]) {
        maCnt++;
      }
    }
    ll gold = 0;
    for (int j = 0; j <= maCnt; j++) {
      if (j > 10) {
        break;
      }
      gold = max(gold, p[i][j]);
      if (j != 0) {
        ma = max(ma, p[i][j]);
      }
      mi = min(mi, p[i][j]);
    }
    res += gold;
  }
  cout << (res == 0 ? ma : res) << endl;
  return 0;
}
