#include<bits/stdc++.h>
using namespace std;
struct stu{
	string name;
	int qi,ping,lun;
	bool xi,gan;
	int m;
}a[105];
bool cmp(stu a,stu b){
	return a.m>b.m;
}
int main(){
	int n,num;
	char tmp;
	cin >> n;
	for(int i=1;i<=n;i++){
		a[i].xi=0;
		a[i].gan=0;
		a[i].m=0;
		cin >> a[i].name >> a[i].qi >> a[i].ping;
		cin >> tmp; if(tmp=='Y') a[i].gan=1;
		cin >> tmp; if(tmp=='Y') a[i].xi=1;
		cin >> a[i].lun;
		if(a[i].qi>80&&a[i].lun) a[i].m+=8000;
		if(a[i].qi>85&&a[i].ping>80) a[i].m+=4000;
		if(a[i].qi>90) a[i].m+=2000;
		if(a[i].qi>85&&a[i].xi) a[i].m+=1000;
		if(a[i].ping>80&&a[i].gan) a[i].m+=850;
	}
	sort(a+1,a+n+1,cmp);
	int ans=0;
	for(int i=1;i<=n;i++) ans+=a[i].m; 
	cout << a[1].name << '\n' << a[1].m << '\n' << ans;
	return 0;
}