#include<bits/stdc++.h>
using namespace std;
struct stu{
	string s;
	int qm,py;
	char bg,xb;
	int lw,id,jxj;
}z[106];
bool cmp(stu a,stu b){
    if(a.jxj!=b.jxj)return a.jxj>b.jxj;
    else return a.id<b.id;	
}
int n,ans=0;
int main(){
   cin>>n;
   for(int i=1;i<=n;i++){
   	   cin>>z[i].s>>z[i].qm>>z[i].py>>z[i].bg>>z[i].xb>>z[i].lw;
   	   z[i].id=i;
   	   if(z[i].qm>80&&z[i].lw>=1)z[i].jxj+=8000;
   	   if(z[i].qm>85&&z[i].py>80)z[i].jxj+=4000;
   	   if(z[i].qm>90)z[i].jxj+=2000;
	   if(z[i].qm>80&&z[i].xb=='Y')z[i].jxj+=1000;
	   if(z[i].py>80&&z[i].bg=='Y')z[i].jxj+=850;	
       ans+=z[i].jxj;
   }
   sort(z+1,z+n+1,cmp); 
   cout<<z[1].s<<endl<<z[1].jxj<<endl<<ans;
	return 0;
}