#include<bits/stdc++.h>
#define LL long long
#define mk make_pair
#define pii std::pair<int,int>
#define fi first
#define se second
const int N = 305;
const int M = 11;
const int INF = 1e9;
using std::cin;
using std::cout;
using std::ios;
using std::max;
using std::min;
using std::vector;
int n,m,F,L;
pii a[N][N],b[N][N];
int fir[N],las[N];
int dirt[N];
int sum[N];
int rk[N],p[N];
vector <int> t1[N];
inline int read(){
	int v = 0,c = 1;char ch = getchar();
	while(!isdigit(ch)){
		if(ch == '-') return -1;
		ch = getchar();
	}
	while(isdigit(ch)){
		v = v * 10 + ch - 48;
		ch = getchar();
	}
	return v * c;
}
inline bool cmpl(int x,int y){
	assert(t1[x].size() == t1[y].size());
	for(int i = 0;i < (int)t1[x].size();++i){
		if(t1[x][i] < t1[y][i]) return 1;
		if(t1[x][i] > t1[y][i]) return 0;	
	}
	return x == n;
}
inline bool cmp(int x,int y){
	return (sum[x] > sum[y]) || (sum[x] == sum[y] && dirt[x] < dirt[y]) || 
	(sum[x] == sum[y] && dirt[x] == dirt[y] && cmpl(x,y));
}
inline int work(){
	int now = 0,s = 0,d = 0;
	for(int i = 1;i <= 10;++i) b[n][i].fi = -1;
	for(int i = 1;i <= 10;++i){
		if(a[n][p[i]].fi == -1) continue;
		if(now + a[n][p[i]].fi <= 300){
			now += a[n][p[i]].fi;
			s++;d += now + a[n][p[i]].se * 20;
			b[n][p[i]].fi = now;
			b[n][p[i]].se = a[n][p[i]].se;
		}
		else break;
	}
	sum[n] = s,dirt[n] = d;

	t1[n].clear();
	for(int i = 1;i <= 10;++i) if(b[n][i].fi != -1) t1[n].push_back(b[n][i].fi);
	sort(t1[n].begin(),t1[n].end());
	reverse(t1[n].begin(), t1[n].end());
	
	int l = 1,r = n - 1,res = n;
	while(l <= r){
		int mid = (l + r) >> 1;
		if(cmp(n,rk[mid])) res = mid,r = mid - 1;
		else l = mid + 1;	
	}
//	printf("case : %d %d %d\n",sum[n],dirt[n],res);
	int cnt = 5000 / res;
	if(res <= n / 10) cnt += 1200;
	else if(res <= n / 10 * 3) cnt += 800;
	else if(res <= n / 10 * 6) cnt += 400;
	int ff = INF,ll = -1;
	for(int i = 1;i <= 10;++i){
		if(b[n][i].fi == -1) continue;	
		if(b[n][i].fi <= fir[i]) cnt += 800;
		ff = min(ff,b[n][i].fi);
		ll = max(ll,b[n][i].fi);
	}
	if(ff != INF && ff <= F) cnt += 700;
	if(ll != -1 && ll >= L) cnt += 500;
	return cnt;
}
int main(){
	n = read();
	for(int i = 1;i <= 300;++i) fir[i] = INF, las[i] = -1,rk[i] = i,F = INF,L = -1;
	for(int i = 1;i <= n;++i){
		for(int j = 1;j <= 10;++j){
			a[i][j].fi = read();
			if(a[i][j].fi == -1) continue;
			a[i][j].se = read();
			if(i == n) continue;
			dirt[i] += a[i][j].fi + a[i][j].se * 20;
			sum[i]++;
			fir[j] = min(fir[j],a[i][j].fi);
			las[j] = max(las[j],a[i][j].fi);
		//	printf("%d %d\n",a[i][j].fi,a[i][j].se);	
		}
	}
	for(int i = 1;i < n;++i){
		for(int j = 1;j <= 10;++j){
			b[i][j] = a[i][j];	
			if(b[i][j].fi != -1) t1[i].push_back(a[i][j].fi);
		}
		sort(t1[i].begin(),t1[i].end());
		reverse(t1[i].begin(), t1[i].end());
	}
	for(int i = 1;i <= 10;++i) F = min(F,fir[i]),L = max(L,las[i]);//,cout << fir[i] << " " << las[i] << "\n";
	int ans = 0;
	std::sort(rk + 1,rk + n,cmp);
	for(int i = 1;i <= 10;++i) p[i] = i;
	do{
		ans = max(ans,work());
	}while(std::next_permutation(p + 1,p + 11));
	printf("%d\n",ans);
    return 0;
}