#include <bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rrep(i, n) for(int i = n-1; i >= 0; --i)
#define fi first
#define se second
using namespace std;
using lint = long long;
using uint = unsigned int;
using ulint = unsigned long long;
using ldouble = long double;
using pii = pair<int, int>;
using pli = pair<lint, lint>;
using pdd = pair<double, double>;
using pld = pair<ldouble, ldouble>;
using v1i = vector<int>;
using v1li = vector<lint>;
using v2i = vector<vector<int>>;
using v2li = vector<vector<lint>>;
using v3i = vector<vector<vector<int>>>;
using v3li = vector<vector<vector<lint>>>;
using v1b = vector<bool>;
using v2b = vector<vector<bool>>;
using v3b = vector<vector<vector<bool>>>;
using v1c = vector<char>;
using v2c = vector<vector<char>>;
using v3c = vector<vector<vector<char>>>;
constexpr lint mod1 = 1e9+7;
constexpr lint mod2 = 998244353;

int main() {
  int n, m = -1e9; scanf("%d", &n);
  v2b v(n, v1b(10)); v2i u(n, v1i(11));
  rep(i, n) rep(j, 10) scanf("%d", &v[i][j]);
  rep(i, n) rep(j, 11) scanf("%d", &u[i][j]);
  rep(i, 1 << 10){
    if(i == 0) continue;
    int t = 0;
    rep(j, n){
      int x = 0;
      rep(k, 10) if(i & 1 << k && v[j][k]) ++x;
      t += v[j][x];
    }
    m = max(m, t);
  }
  printf("%d\n", m);
  return 0;
}