#include <iostream>
#include <cmath>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
int num1 = 0;
int num2 = 0; //total

struct Node {
	//char name[30];
	string name;
	int finalscore;
	int classscore;
	char ganbu;
	char west;
	int essay;
	int money = 0;
	int type;
};

bool cmp(const Node &a, const Node &b) {
	if (a.money != b.money)
		return a.money > b.money;
	else
		return a.type < b.type;
	//return a.money > b.money;
}

int main() {
	int n;
	cin >> n;
	Node stu[101];
	for (int i = 1; i <= n; i++) {
		cin >> stu[i].name;
		scanf("%d %d %c %c %d", &stu[i].finalscore, &stu[i].classscore, &stu[i].ganbu, &stu[i].west, &stu[i].essay);
		stu[i].type = i;
		if (stu[i].finalscore > 80 && stu[i].essay >= 1) {
			stu[i].money += 8000;
			num2 += 8000;
		}
		if (stu[i].finalscore > 85 && stu[i].classscore > 80) {
			stu[i].money += 4000;
			num2 += 4000;
		}
		if (stu[i].finalscore > 90) {
			stu[i].money += 2000;
			num2 += 2000;
		}
		if (stu[i].west == 'Y') {
			stu[i].money += 1000;
			num2 += 1000;
		}
		if (stu[i].classscore > 80 && stu[i].ganbu == 'Y') {
			stu[i].money += 850;
			num2 += 850;
		}
	}
	sort(stu + 1, stu + 1 + n, cmp);
	cout << stu[1].name << endl;
	cout << stu[1].money << endl;
	cout << num2 << endl;
	return 0;
}