#include<iostream>
#include<algorithm>
using namespace std;
struct xs{
   string xm;
   int pj,py,zs,lw,xh;
   char gb,xb;
}a[101];
bool cmp(xs a1,xs a2){
   if(a1.zs>a2.zs)return a1.zs>a2.zs;
   return a1.xh<a2.xh;
}
int main(){
   int n,ans=0;
   cin>>n;
   for(int i=1;i<=n;i++){
   	cin>>a[i].xm>>a[i].pj>>a[i].py;
   	cin>>a[i].gb>>a[i].xb>>a[i].lw;
   	a[i].xh=i;
   	if(a[i].pj>80&&a[i].lw>=1)a[i].zs+=8000;
   	if(a[i].pj>85&&a[i].py>80)a[i].zs+=4000;
   	if(a[i].pj>90)a[i].zs+=2000;
   	if(a[i].pj>85&&a[i].xb=='Y')a[i].zs+=1000;
   	if(a[i].py>80&&a[i].gb=='Y')a[i].zs+=850;
   }
   sort(a+1,a+n+1,cmp);
   for(int i=1;i<=n;i++){
   	ans+=a[i].zs;
   }
   cout<<a[1].xm<<endl;
   cout<<a[1].zs<<endl;
   cout<<ans<<endl;
   return 0;
}