#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
struct student{
	string name;
	int qimo,banji,lunwen,jiangxuejin,hao;
	char ganbu,xibu;
}a[102];
bool cmp(student a,student b)
{
	if(a.jiangxuejin!=b.jiangxuejin)
	return a.jiangxuejin>b.jiangxuejin;
	else return a.hao<b.hao;
}
int main()
{
	int n,i,sum=0;
	cin>>n;
	for(i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].qimo>>a[i].banji>>a[i].ganbu>>a[i].xibu>>a[i].lunwen;
		a[i].hao=i;
		if(a[i].qimo>80&&a[i].lunwen>=1) a[i].jiangxuejin+=8000;
		if(a[i].qimo>85&&a[i].banji>=80) a[i].jiangxuejin+=4000;
		if(a[i].qimo>90) a[i].jiangxuejin+=2000;
		if(a[i].qimo>85&&a[i].xibu=='Y') a[i].jiangxuejin+=1000;
		if(a[i].banji>80&&a[i].ganbu=='Y') a[i].jiangxuejin+=850;
		sum+=a[i].jiangxuejin;
	}
	sort(a+1,a+n+1,cmp);
	cout<<a[1].name<<endl<<a[1].jiangxuejin<<endl<<sum;
	return 0;
}