#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=305;
struct ai{
    int pine,cnt ;
    vector<int> v ;
}q[N];
struct bi{
    int f ;
    int x , y ;
}t[11];
int last=-1,first=301;
int f[11]={301};
int a[15];
bool cmp(ai a,ai b)
{
    if(a.cnt == b.cnt)
        if(a.pine==b.pine){
            return a.v<b.v;
        }
        else return a.pine<b.pine;
    else return a.cnt > b.cnt ;
}
void solve(){
	int n;
	cin>>n;
    string s;
    getline(cin,s) ;
    for(int i=1;i<=n;i++)
    {
        getline(cin , s) ;
        int cnt=0,pine=0,p=1;
        for(int j = 0 ; j < s.size() ; j ++)
        {
            if(s[j] == ',')p ++ ;
            else if(s[j] == '-');
            else if(s[j] == ' ');
            else{
                int z = 0 , k = j + 1 ;
                while(k < s.size() && s[k] >= '0' && s[k] <= '9')k++;
                for(int kk=j;kk<k;kk++)z=z*10+s[kk]-'0';
                if(k < s.size() && s[k] == ' ')
                {
                    cnt++,pine +=z;
                    q[i].v.push_back(z);
                    f[p]=min(f[p],z) ;
                    first=min(first,z) ;
                    last=max(last,z) ; 
                }
                else
                {
                    pine+=z*20 ;
                }

                j = k - 1 ;
            }
        }
        q[i].cnt=cnt,q[i].cnt=cnt;
        sort(q[i].v.begin(),q[i].v.end());
    }
    getline(cin , s) ;
    int p = 1 ;
    for(int j = 0 ; j < s.size() ; j ++)
    {
        if(s[j] == ',')p ++ ;
        else if(s[j] == '-')t[p].f = 0 ;
        else if(s[j] == ' ');
        else{
            t[p].f = 1 ;
            int z = 0 , k = j + 1 ;
            while(k < s.size() && s[k] >= '0' && s[k] <= '9')k ++ ;
            for(int kk=j;kk<k;kk++)z=z*10+s[kk]-'0';
            if(k < s.size() && s[k] == ' ')
            {
                t[p].x=z;
            }
            else
            {
                t[p].y=z ;
            }
            j = k - 1 ;
        }
    }
    sort(q + 1 , q + 1 + n - 1 , cmp) ;
    for(int i=1;i<=10;i++) a[i] = i ;
    int happy=0;
    do
    {
        vector<int>v;
        int fa=0,guoti=0,time=0;
        int th=0;
        bool ok=0,okk=0;
        for(int i=1;i<=10;i++)
        {
            bi j = t[a[i]] ;
            if(j.f){
                if(time+j.x>300)
                {
                    break ;
                }
                time+=j.x;
                v.push_back(time);
                if(time<=first)ok=1;
                if(time >= last) okk = 1 ;
                if(time<=f[a[i]])th+=800;
                guoti++;
                fa+=j.y*20;
                fa+=time;
            }
        }
        sort(v.begin(),v.end());
        if(ok)th+=700;
        int l = 1 , r = n ;
        ai t={fa,guoti,v};
        while(l < r)
        {
            int mid = l +r >> 1 ;
            if(cmp(q[mid],t))l=mid+1; 
            else r = mid  ;
        }
        th+=5000/r;
        if(r<=n/10){
            th+=1200;
        }
        else if(r<=n/10*3){
            th+=800;
        }
        else if(r<=n/10*6){
            th+=400;
        }
        if(okk==1)th+=500;
        happy=max(happy,th);
    } while (next_permutation(a + 1 , a + 1 + 10));
    cout<<happy<<'\n';
	return;
}
int main(){
	ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
	int t=1;
	while(t--){
		solve();
	}
	return 0;
}