#include<iostream>
#include<algorithm>
using namespace std;
int n;
const int N=300;
struct node
{
	int num;
	string name;
	int score1,score2;
	char  judge1,judge2;
	int data;
	int money;
}a[N];

bool cmp(node a,node b)
{
	if(a.money!=b.money)
	return a.money>b.money;
	else
	a.num<b.num;
}
int sum;
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		a[i].num=i;
		cin>>a[i].name>>a[i].score1>>a[i].score2>>a[i].judge1>>a[i].judge2>>a[i].data;
		if(a[i].score1>80&&a[i].data>=1)
		a[i].money+=8000;
		if(a[i].score1>85&&a[i].score2>80)
		a[i].money+=4000;
		if(a[i].score1>90)
		a[i].money+=2000;
		if(a[i].score1>85&&a[i].judge2=='Y')
		a[i].money+=1000;
		if(a[i].score2>80&&a[i].judge1=='Y')
		a[i].money+=850;
		sum+=a[i].money;
	}
   sort(a+1,a+1+n,cmp);
   for(int i=0;i<a[1].name.size();i++)
   printf("%c",a[1].name[i]);
   printf("\n");
   printf("%d\n%d",a[1].money,sum);
	return 0;
}