#include<bits/stdc++.h>
using namespace std;  
struct Node{
	string name;
	int exam;
	int classroom;
	char s;
	char w;
	int a;
	long long so=0;
}n[1000];

int nn;     

long long sum; 

string maxn;
long long maxs=-1;
int main() 
{
	cin>>nn;
	for(int i=0;i<nn;i++)
	{
		cin>>n[i].name;
		cin>>n[i].exam;
		cin>>n[i].classroom;
		cin>>n[i].s;
		cin>>n[i].w;
		cin>>n[i].a;
		
		if(n[i].exam>80&&n[i].a>=1)
			n[i].so+=8000;
			
		if(n[i].exam>85&&n[i].classroom>80)
			n[i].so+=4000;
			
		if(n[i].exam>90)
			n[i].so+=2000;
			
		if(n[i].exam>85&&n[i].w=='Y')
			n[i].so+=1000;
			
		if(n[i].exam>80&&n[i].s=='Y')
			n[i].so+=850;
		
		sum+=n[i].so;
	}
	
	for(int i=nn-1;i>=0;i--)
		if(n[i].so>=maxs)
		{
			maxs=n[i].so;
			maxn=n[i].name;
		}
		
	cout<<maxn<<endl;
	cout<<maxs<<endl;
	cout<<sum<<endl;
    return 0;
}