#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define all(s) s.begin(), s.end()
using namespace std;
int n;
auto read(){
	string s; getline(cin, s);
	array<pii, 10> res;
	fill(all(res), make_pair(-1, -1));
	for(int i=0,l=0;i<10;i++){
		int r = l;
		while(r < s.size() && (s[r] ^ ',')) ++r;
		string real = s.substr(l, r-l);
		if(real == "-") res[i] = {-1, -1};
		else{
			int m = real.find(' ');
			res[i].first = stoll(real.substr(0, m)), res[i].second = stoll(real.substr(m+1));
		}
		l = r+1;
	}
	return res;
} 

signed main(){
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n; cin.get();
	vector<array<pii, 10>> a(n-1);
	vector<vector<int>> stand;
	vector<int> first_solve(10, 300);
	int fst = 300, lst = 0;
	for(int i=0;i<n-1;i++){
		a[i] = read();
		int solved = 0, penalty = 0;
		vector<int> v{0, 0};
		for(int j=0;j<10;j++){
			if(a[i][j].first==-1) continue;
			++solved;
			penalty += a[i][j].first + a[i][j].second * 20;
			first_solve[j] = min(first_solve[j], a[i][j].first);
			fst = min(fst, a[i][j].first);
			lst = max(lst, a[i][j].first);
			v.push_back(-a[i][j].first);
		}
		sort(v.begin() + 2, v.end());
		v[0] = solved, v[1] = -penalty;
		stand.push_back(v);
	}
	auto me = read();
	vector<int> perm;
	for(int i=0;i<10;i++) if(me[i].first != -1) perm.push_back(i);
	
	int ans = 0;
	do{
		int solved = 0, penalty = 0, happiness = 0, time = 0;
		vector<int> v{0, 0};
		bool F = 0, L = 0;
		for(int i=0;i<perm.size();i++){
			int j = perm[i];
			time += me[j].first;
			if(time > 300) break;
			++solved;
			penalty += time + me[j].second * 20;
			if(time <= fst) F = 1;
			if(time >= lst) L = 1;
			if(time <= first_solve[j]) happiness += 800;
			v.push_back(-time);
		}
		if(F) happiness += 700;
		if(L) happiness += 500;
		sort(v.begin()+2, v.end());
		v[0] = solved, v[1] = -penalty;
		int rk = n - (upper_bound(all(stand), v) - stand.begin());
		happiness += 5000 / rk;
		if(rk <= n/10) happiness += 1200;
		else if(rk <= n/10 * 3) happiness += 800;
		else if(rk <= n/10 * 6) happiness += 400;
		ans = max(ans, happiness);
	}while(next_permutation(all(perm)));
	cout << ans;
}