#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<climits>
#include<iomanip>
#include<vector>
#include<queue>
#include<map>
using namespace std;
struct xs {
	int qimo, banji, lunwen;
	char xsgb, xbsf;
	string name;
	int sum = 0;
} a[1000005];
bool cmp(xs x, xs y){
	return x.sum > y.sum;
}
int n, summ = 0;
int main() {
	scanf("%d", &n);
	for(int i = 0; i < n; i ++) {
		cin >> a[i].name;
		scanf("%d%d%c%c%d", &a[i].qimo, &a[i].banji, &a[i].xsgb, &a[i].xbsf, &a[i].lunwen);
	}
	for(int i = 0; i < n; i ++) {
		if(a[i].qimo > 80 && a[i].lunwen) {
			a[i].sum += 8000;
		}
		if(a[i].qimo > 85 && a[i].banji > 80) {
			a[i].sum += 4000;
		}
		if(a[i].qimo > 90) {
			a[i].sum += 2000;
		}
		if(a[i].qimo > 85 && a[i].xbsf == 'Y') {
			a[i].sum += 1000;
		}
		if(a[i].banji > 80 && a[i].xsgb == 'Y') {
			a[i].sum += 850;
		}
		summ += a[i].sum;
	}
	sort(a, a + n + 1, cmp);
	cout << a[0].name << endl;
	printf("%d\n%d", a[0].sum, summ);
	return 0;
}