#include <fstream>
#include <algorithm>
using namespace std;
class student
{
public:
	int id;
	string xm;
	int pj,py,lw,jxj;
	char bg,xb;
};
bool cmp(student x,student y)
{
	return (x.jxj>y.jxj||(x.jxj==y.jxj&&x.id>y.id));
}
student stu[101];
int i,j,n,s=0;
int main()
{
	ifstream fin("scholar.in");
	ofstream fout("scholar.out");
	fin>>n;
	for(i=1;i<=n;i++)
	{
		stu[i].id=i;
		fin>>stu[i].xm>>stu[i].pj>>stu[i].py>>stu[i].bg>>stu[i].xb>>stu[i].lw;
		if(stu[i].pj>80 && stu[i].lw>=1)
			stu[i].jxj=stu[i].jxj+8000;
		if(stu[i].pj>85 && stu[i].py>80)
			stu[i].jxj=stu[i].jxj+4000;
		if(stu[i].pj>90)
			stu[i].jxj=stu[i].jxj+2000;
		if(stu[i].pj>85 && stu[i].xb=='Y')
			stu[i].jxj=stu[i].jxj+1000;
		if(stu[i].py>80 && stu[i].bg=='Y')
			stu[i].jxj=stu[i].jxj+850;
		s=s+stu[i].jxj;
	}
	sort(stu+1,stu+n+1,cmp);
	fout<<stu[1].xm<<endl<<stu[1].jxj<<endl;
	fout<<s<<endl;
	fin.close();fout.close();
	return 0;
}