#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node
{
char map[100];
int x,y,z;
char w1,w2;
int m;
int ma;
}num[10000];
bool cmp(node a,node b)
{

if(a.m==b.m)
return a.ma<b.ma; else return a.m>b.m;
}
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int ans=0;
int i,j;
for(i=0;i<n;i++)
{
scanf("%s",num[i].map);
scanf("%d%d",&num[i].x,&num[i].y);
getchar();
scanf("%c",&num[i].w1);
getchar(); scanf("%c",&num[i].w2);
scanf("%d",&num[i].z);
num[i].ma=i;
num[i].m=0;
}
for(i=0;i<n;i++) { if(num[i].x>80&&num[i].z>=1)
{
num[i].m+=8000;
}
if(num[i].x>85&&num[i].y>80)
{
num[i].m+=4000;
}
if(num[i].x>90)
num[i].m+=2000;
if(num[i].x>85&&num[i].w2=='Y')
num[i].m+=1000;
if(num[i].y>80&&num[i].w1=='Y')
num[i].m+=850;
ans+=num[i].m;
}
sort(num,num+n,cmp);
printf("%s\n",num[0].map);
printf("%d",num[0].m);
printf("\n%d\n",ans);
}
return 0;
}