#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
struct node {
	string name;
	int qm,py,jj=0;
	char lw,xb,gb;
} a[1001];
int main() {
	int T,sum=0,l,e[1001];
	cin>>T;
	for(int i=1; i<=T; i++) {
		cin>>a[i].name>>a[i].qm>>a[i].py>>a[i].gb>>a[i].xb>>a[i].lw;
		if(a[i].qm>80&&a[i].lw!='0') {
			sum+=8000;
			a[i].jj+=8000;
		}
		if(a[i].qm>85&&a[i].py>80) {
			sum+=4000;
			a[i].jj+=4000;
		}
		if(a[i].qm>90) {
			sum+=2000;
			a[i].jj+=2000;
		}
		if(a[i].qm>85&&a[i].xb=='Y') {
			sum+=1000;
			a[i].jj+=1000;
		}
		if(a[i].qm>80&&a[i].gb=='Y') {
			sum+=850;
			a[i].jj+=850;
		}
	}
	for(int x=1; x<=T; x++) {
		for(int j=1; j<=T; j++) {
			if(a[x].jj>a[j].jj) {
				swap(a[x].name,a[j].name);
				swap(a[x].jj,a[j].jj);
			}
		}
	}
	cout<<a[1].name<<endl<<a[1].jj<<endl<<sum;

}

样例过了，但是0分