#include <bits/stdc++.h>
using namespace std;
inline int in() {
  int x;
  scanf("%d", &x);
  return x;
}
template <typename T>
inline istream& operator>>(istream& i, vector<T>& v) {
  for (int j = 0; j < ((int)(v).size()); ++j) i >> v[j];
  return i;
}
template <typename T>
string join(const vector<T>& v) {
  stringstream s;
  for (int i = 0; i < ((int)(v).size()); ++i) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename T>
inline ostream& operator<<(ostream& o, const vector<T>& v) {
  if ((int)(v).size()) o << join(v);
  return o;
}
template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
  return i >> v.first >> v.second;
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& o, const pair<T1, T2>& v) {
  return o << v.first << "," << v.second;
}
template <typename T>
inline long long int suma(const vector<T>& a) {
  long long int res(0);
  for (auto&& x : a) res += x;
  return res;
}
const double eps = 1e-10;
const long long int LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MX = 200005;
int main() {
  int n;
  scanf("%d", &n);
  int f[n + 1][10];
  for (int i = 1; i < n + 1; ++i) {
    for (int j = 0; j < (10); ++j) {
      cin >> f[i][j];
    }
  }
  int p[n + 1][11];
  for (int i = 1; i < n + 1; ++i) {
    for (int j = 0; j < (11); ++j) {
      cin >> p[i][j];
    }
  }
  int ans = 0;
  for (int i = 1; i < 1024; ++i) {
    int a[10];
    int ii = i;
    for (int j = 0; j < (10); ++j) {
      a[j] = ii % 2;
      ii /= 2;
    }
    int ans2 = 0;
    for (int j = 1; j < n + 1; ++j) {
      int count = 0;
      for (int k = 0; k < (10); ++k) {
        if (a[k] + f[j][k] == 2) {
          count++;
        }
      }
      ans2 += p[j][count];
    }
    (ans = max(ans, ans2));
  }
  cout << ans << endl;
  return 0;
}
