#include <bits/stdc++.h>
using namespace std;
struct Node{
	string name;
	int aver;
	int clas;
	string sta,west;
	bool f1,f2;
	int page;
	int num;
	int money;
}a[108];
bool cmp(Node a,Node b){
	if(a.money == b.money) return a.num<b.num;
	else return a.money > b.money; 
}
int main()
{
	long long cnt = 0;
	int n;
	cin>>n;
	for(int i = 1;i<=n;i++){
		cin>>a[i].name>>a[i].aver>>a[i].clas>>a[i].sta>>a[i].west>>a[i].page;
		a[i].num = i;
		a[i].money = 0;
	}
	for(int i = 1;i<=n;i++){
		if(a[i].aver>80 && a[i].page>=1){
			a[i].money += 8000;
		}
		if(a[i].aver>85 && a[i].clas > 80){
			a[i].money += 4000;
		}
		if(a[i].aver>90) {
			a[i].money += 2000;
		}
		if(a[i].aver > 85 && a[i].west == "Y"){
			a[i].money += 1000;
		}
		if(a[i].clas>=80 && a[i].sta == "Y"){
			a[i].money += 850;
		}
	}
	for(int i = 1;i<=n;i++){
		cnt += a[i].money;
	}
	sort(a+1,a+1+n,cmp);
	cout<<a[1].name<<endl<<a[1].money<<endl<<cnt;
	return 0;
}