#include<bits/stdc++.h>
using namespace std; 
struct jxj{
	string nm;
	int x,y,z,ans=0;
	char c,d;
}a[1001];
int main() {
	int n,j,maxx=-1,sum=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++) {
		cin>>a[i].nm>>a[i].x>>a[i].y>>a[i].c>>a[i].d>>a[i].z;
	}
	for(int i=1;i<=n;i++) {
		if(a[i].x>80&&a[i].z>=1) {
			a[i].ans+=8000;
		}
		if(a[i].x>85&&a[i].y>80) {
			a[i].ans+=4000;
		}
		if(a[i].x>90) {
			a[i].ans+=2000;
		}
		if(a[i].ans>85&&a[i].d=='Y') {
			a[i].ans+=1000;
		}
		if(a[i].y>80&&a[i].c=='Y') {
			a[i].ans+=850;
		}
		sum+=a[i].ans;
	}
	for(int i=1;i<=n;i++) {
		if(a[i].ans>maxx) {
			maxx=a[i].ans;
			j=i;
		}
	}
	printf("%d\n%d\n%d",a[j].nm,a[j].ans,sum);
}