#include<bits/stdc++.h>
using namespace std;
int n,ans;
struct node{
	string name;
	int a,b,l,z;
	char c,w;
} s[101];
bool cmp(node t,node t1){
	return t.z>t1.z;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i].name>>s[i].a>>s[i].b>>s[i].c>>s[i].w>>s[i].l;
		if(s[i].a>80&&s[i].l) s[i].z+=8000;
		if(s[i].a>85&&s[i].b>80) s[i].z+=4000;
		if(s[i].a>90) s[i].z+=2000;
		if(s[i].a>85&&s[i].w=='Y') s[i].z+=1000;
		if(s[i].b>80&&s[i].c=='Y') s[i].z+=850;
		ans+=s[i].z;
	}
	sort(s+1,s+n+1,cmp);
	cout<<s[1].name<<endl<<s[1].z<<endl;
	for(int i=2;i<=n;i++){
		if(s[i].z==s[i-1].z){
			cout<<s[i].name<<endl<<s[i].z<<endl;
		}
		else break;
	}
	cout<<ans;
	return 0;
}