#include<bits/stdc++.h>
using ll  = long long;
#define int ll
#define rep(i,n) for(int i=0;i<n;i++)
#define loop(i,s,n) for(int i=s;i<n;i++)
#define erep(e,v) for(auto && e :v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9:(int)1e18)
#define EPS 0.0000000001
using namespace std;
template<class T, class S> void cmin(T &a, const S &b) { if (a > b)a = b; }
template<class T, class S> void cmax(T &a, const S &b) { if (a < b)a = b; }
template<typename Head, typename Value> auto vectors(const Head &head, const Value &v) { return vector<Value>(head, v); }
template<typename Head, typename... Tail> auto vectors(Head x, Tail... tail) { auto inner = vectors(tail...); return vector<decltype(inner)>(x, inner); }
template<class T> void join(T a){for(auto itr :a){if(itr != *a.begin())cout << " "; cout << itr;} }
using ld  = long double;
using pii = pair<int,int>;
using piii = pair<int,pii>;
int W,H;
int dx[]={0,0,1,-1}, dy[]={1,-1,0,0};
bool valid(int x,int y){return (0<=x&&x<W)&&(0<=y&&y<H);}
signed main(){
    int n; cin >> n;
    vector<vector<int>>F(n,vector<int>(10));
    rep(i,n)rep(j,10) cin >> F[i][j];
    vector<vector<int>>p(n,vector<int>(11));
    erep(a,p)erep(e,a) cin >> e;
    int ans = -INF;
    for (int bit = 1; bit < 1 << 10;bit++){
        int sub = 0;
        for(int i = 0; i < n; i++){
            int cost = 0;
            for(int j = 0; j< 10;j++){
                if(bit & (1 << j))
                    if (F[i][j])cost++;
                sub += p[j][cost];
                
            }
            cmax(ans, sub);
        }
        cout << ans << endl;
    }
}
    
