#include<bits/stdc++.h>
using namespace std;
int n, b[101], t, i, ma, r = 0;
struct node{
	string a, h, g;
	int c, d, f;
	int e = 0;
} a[101];
int main() {
	cin >> n;
	for (i = 1; i <= n; i++) {
		cin >> a[i].a >> a[i].c >> a[i].d >> a[i].h >> a[i].g >> a[i].f;
		cout << endl;
	}
	for (i = 1; i <= n; i++) {
		if (a[i].c > 80 && a[i].f >= 1) a[i].e += 8000;
		if (a[i].c > 85 && a[i].d > 80) a[i].e += 4000;
		if (a[i].c > 90) a[i].e += 2000;
		if (a[i].c > 85 && a[i].g == "Y") a[i].e += 1000;
		if (a[i].d > 85 && a[i].h == "Y") a[i].e += 850;
		b[i] = a[i].e;
	}
	ma = b[1];
	r += b[1];
	for (i = 2; i <= n; i++) {
		if (b[i] > ma) {
			ma = b[i];
			t = i;
		}
		r += b[i];
	}
	cout << a[t].a << endl;
	cout << ma << endl;
	cout << r << endl;
	return 0;
}