#include <bits/stdc++.h>
using namespace std;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
  return os << "(" << p.first << "," << p.second << ")";
}
template <typename T>
T sq(T a) {
  return a * a;
}
template <typename T>
T gcd(T a, T b) {
  if (a > b) return gcd(b, a);
  return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
  if (n == 0) return 1;
  if (n == 1) return b;
  if (n % 2 == 0) {
    return mypow(b * b, n / 2);
  } else {
    return mypow(b, n - 1) * b;
  }
}
ll pcnt(ll b) { return __builtin_popcountll(b); }
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  int F[N][10];
  for (ll i = (0); i < (N); i++) {
    for (ll j = (0); j < (10); j++) {
      cin >> F[i][j];
    }
  }
  ll P[N][10];
  for (ll i = (0); i < (N); i++) {
    for (ll j = (0); j < (10); j++) {
      cin >> P[i][j];
    }
  }
  ll benefit[N][10];
  for (ll i = (0); i < (N); i++) {
    for (ll j = (0); j < (10); j++) {
      benefit[i][j] = F[i][j] * P[i][j];
    }
  }
  ll PRO[10] = {};
  for (ll i = (0); i < (10); i++) {
    for (ll j = (0); j < (N); j++) {
      PRO[i] += benefit[j][i];
    }
  }
  sort(PRO, PRO + 10);
  ll ans = PRO[0];
  for (ll i = (1); i < (10); i++) {
    if (PRO[i] > 0) {
      ans += PRO[i];
    } else {
      break;
    }
  }
  cout << ans << endl;
  return 0;
}
