#include<bits/stdc++.h>
using namespace std;
struct node{
	string xm;
	int qm,bj,lw,jj,xh,hs;
	char x,g;
}a[110];
bool cmp(node x,node y)
{
    if(x.jj==y.jj) return x.hs<y.hs;
    else return x.jj>y.jj;
}
int n,c=0;
int main(){
	cin>>n;
	for(int i=1;i<=n;++i){
		cin>>a[i].xm>>a[i].qm>>a[i].bj>>a[i].x>>a[i].g>>a[i].lw;
		a[i].hs==i;
		if(a[i].qm>80&&a[i].lw>=1) a[i].jj+=8000;
		if(a[i].qm>85&&a[i].bj>80) a[i].jj+=4000;
		if(a[i].qm>90) a[i].jj+=2000;
		if(a[i].qm>85&&a[i].x=='Y') a[i].jj+=1000;
		if(a[i].bj>80&&a[i].g=='Y') a[i].jj+=850;
		c+=a[i].jj;
	}
	sort(a+1,a+n+1,cmp);
	cout<<a[1].xm<<endl<<a[1].jj<<endl<<c;
	return 0;
}

求助大佬