#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int MAX = 7474;
const int MAX2 = 304;

struct node
{
	int nxt[MAX2];
	int pref[MAX2];
	int cnt;
	
	node()
	{
		cnt = 0;
		FOR (i, 0, MAX2) nxt[i] = -1;
	}
	
} trie[MAX];

int idx = 0;

int roots[14][MAX];
int c[14][MAX];
int prob[14];

void add(VI v, int i, int j)
{
	if (i == SZ(v)) trie[j].cnt++;
	else
	{
		trie[j].cnt++;
		if (trie[j].nxt[v[i]] == -1)
			trie[j].nxt[v[i]] = idx++;
		
		
		add(v, i + 1, trie[j].nxt[v[i]]);
	}
}

void add(int cnt, int tot, VI v)
{
	prob[cnt]++;
	c[cnt][tot]++;
	if (roots[cnt][tot] == -1)
		roots[cnt][tot] = idx++;
	
	add(v, 0, roots[cnt][tot]);
}

vector<PII> parse(string s)
{
	vector<PII> v;
	string t = "";
	s += ',';
	FOR (j, 0, SZ(s))
	{
		if (s[j] == ',')
		{	
			int time, wa;
			
			if (t == "-")
			{
				time = 474;
				wa = -1;
			}
			else
			{
				int k = 0;
				while(k < SZ(t) && t[k] != ' ') k++;
				assert(k < SZ(t));
				
				time = stoi(t.substr(0, k));
				wa = stoi(t.substr(k + 1, SZ(t) - (k + 1)));
			}
			t = "";
			v.PB({time, wa});
		}
		else
			t += s[j];
	}
	return v;
}

int get_pos(int cnt, int t, VI& v)
{
	if(cnt == 0)
		return prob[0] + 1;
		
	int ans = c[cnt][t - 1] + 1;
	int r = roots[cnt][t];
	if (r == -1) return ans;
	FOR (i, 0, SZ(v))
	{
		int j = v[i];
		int to = trie[r].nxt[j];
		ans += trie[r].pref[j - 1];
		if (to == -1) break;
		r = to;
	}
	return ans;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	FOR (i, 0, 14) FOR (j, 0, MAX) roots[i][j] = -1;
	
	int n;
	cin >> n;
	string trash;
	getline(cin, trash);
	VI mn(10, 474);
	int MN = 7474, MX = 0;
	FOR (iter, 0, n - 1)
	{
		string s;
		getline(cin,  s);
		
		vector<PII> v = parse(s);
		int cnt = 0;
		int tot = 0;
		
		assert(SZ(v) == 10);
		
		FOR (i, 0, SZ(v))
		{
			if (v[i].S != -1)
			{
				cnt++;
				tot += v[i].F + v[i].S * 20;
				MN = min(MN, v[i].F);
				MX = max(MX, v[i].F);
			}
			mn[i] = min(mn[i], v[i].F);
		}
		
		sort(ALL(v));
		int j = 9;
		while (j >= 0 && v[j].S == -1)
		{
			v.pop_back();
			j--;
		}
		reverse(ALL(v));
		VI toad;
		FOR (i, 0, j + 1) toad.PB(v[i].F);
		if (j >= 0)
			add(cnt, tot, toad);
	}
	
	FOR (i, 0, MAX)
	{
		FOR (j, 0, MAX2) 
		{
			trie[i].pref[j] = 0;
			
			if (trie[i].nxt[j] != -1)
				trie[i].pref[j] += trie[trie[i].nxt[j]].cnt;
			if(j > 0)
				trie[i].pref[j] += trie[i].pref[j - 1];
		}
	}
	RFOR (i, 13, 0)
	{
		int st = prob[i + 1];
		FOR (j, 0, MAX)
		{
			c[i][j] += st;
			st = c[i][j];
		}
		prob[i] = st;
	}
	
	string s;
	getline(cin, s);
	vector<PII> v = parse(s);
	//sort(ALL(v));
	
	
	VI idxes(10);
	iota(ALL(idxes), 0);
	
	int ans = 0;
	do
	{
		int an = 0;
		int p = 0;
		int t = 0;
		int w = 0;
		VI times;
		bool hasmx = 0;
		FOR (i, 0, 10)
		{
			if (v[idxes[i]].S == -1 || v[idxes[i]].F + t > 300) break; // ? +- 1
			
			p++;
			t += v[idxes[i]].F;
			if(i == 0 && t <= MN)
				an += 700;		
			if(!hasmx && t >= MX){
				an += 500;
				hasmx = 1;
			}
			
			
			w += t + 20 * v[idxes[i]].S;
			times.PB(t);
			if (t <= mn[idxes[i]]) an += 800; //
		}
		reverse(ALL(times));
				
		int pos = get_pos(p, w, times);
		
		an += 5000 / pos;
		if (pos <= n / 10) an += 1200;
		else if (pos <= 3 * n / 10) an += 800;
		else if (pos <= 6 * n / 10) an += 400;
		ans = max(ans, an);
		
		/*if(an == 2000){
			cout << p << " " << t << " " << w << " " << pos << endl;
			FOR(i, 0, 10)
				cout << v[idxes[i]].F << " " << v[idxes[i]].S << endl;
			return 0;
		}*/
		
	} while (next_permutation(ALL(idxes)));
	
	cout << ans << '\n';
	
	
	
	return 0;
}