#include<bits/stdc++.h>

using namespace std;

long long n,res=0;

struct ks
{
	string name;
	long long zf,pf,jxj;
	char xs,gb;
	long long lws;
}ksm[100005];

bool cmp(ks a,ks b)
{
    if(a.jxj<b.jxj)
    {
        return false;
    }
    else
    {
        return true;
    }
}

int main()
{
	cin>>n;
	for(long long i=1;i<=n;i++)
	{
		cin>>ksm[i].name>>ksm[i].zf>>ksm[i].pf>>ksm[i].gb>>ksm[i].xs>>ksm[i].lws;
		if(ksm[i].zf>80 && ksm[i].lws>=1)
		{
			ksm[i].jxj+=8000;
		}
		if(ksm[i].zf>85 && ksm[i].pf>80)
		{
			ksm[i].jxj+=4000;
		}
		if(ksm[i].zf>90)
		{
			ksm[i].jxj+=2000;
		}
		if(ksm[i].zf>85 && ksm[i].xs=='Y')
		{
			ksm[i].jxj+=1000;
		}
		if(ksm[i].pf>80 && ksm[i].gb=='Y')
		{
			ksm[i].jxj+=850;
		}
		res+=ksm[i].jxj;
	}
	sort(ksm+1,ksm+1+n,cmp);
	cout<<ksm[1].name<<endl;
	cout<<ksm[1].jxj<<endl;
	cout<<res;
	return 0;
}