#include <vector> 
#include <list> 
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
using namespace std;

//conversion
//------------------------------------------
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }

//math
//-------------------------------------------
template<class T> inline T sqr(T x) { return x * x; }

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))

//debug
#define dump(x)  cerr << #x << '=' << (x) << endl;
#define debug(x) cerr << #x << '=' << (x) << '('<<'L' << __LINE__ << ')' << ' ' << __FILE__ << endl;

const LL mod = 1e9 + 7;


bool F[101][5][2];
LL P[101][11];
int main() {
	
	int N;
	cin >> N;

	REP(i, N)REP(j, 5)REP(k, 2) {
		cin >> F[i][j][k];
	}
	REP(i, N)REP(j, 11) {
		cin >> P[i][j];
	}
	LL maxscore = -9223372036854775807i64;
	for (int p = 1; p < (1 << 10); p++) {
		VI kaburi(N);
		REP(i, N) { kaburi[i] = 0; }
		for(int i = 0; i < 5; i++) {
			if ((p&(1 << (2*i))) != 0) {
				REP(j, N) {
					kaburi[j] += F[j][i][0];
				}
			}
			if ((p&(1 << ((2*i)+1))) != 0) {
				REP(j, N) {
					kaburi[j] += F[j][i][1];
				}
			}
		}

		LL score = 0LL;
		REP(i, N) {
			score += P[i][kaburi[i]];
		}
		//debug(score);
		maxscore = max(score, maxscore);
	}
	cout << maxscore << endl;

}