#include<bits/stdc++.h>
using namespace std;
struct data{
string name;
int kao;
int ping;
string gan;
string sheng;
bool xue;
bool xi;
int lun;
int fen;
int num;
}a[110];
int cmp(data x,data y){
if(x.fen>y.fen){
return 1;
}
else if(x.fen=y.fen){
if(x.num<y.num) return 1;
else return 0;
}
else{
return 0;
}
}
int n;
int sum=0;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].name>>a[i].kao>>a[i].ping>>a[i].gan>>a[i].sheng>>a[i].lun;
if(a[i].gan=="Y") a[i].xue=true;
else a[i].xue=false;
if(a[i].sheng=="Y") a[i].xi=true;
else a[i].xi=false;
a[i].fen=0;
a[i].num=i;
}
for(int i=1;i<=n;i++){
if(a[i].kao>80&&a[i].lun>=1) a[i].fen+=8000;
if(a[i].kao>85&&a[i].ping>80) a[i].fen+=4000;
if(a[i].kao>90) a[i].fen+=2000;
if(a[i].kao>85&&a[i].xi==true) a[i].fen+=1000;
if(a[i].ping>80&&a[i].xue==true) a[i].fen+=850;
}
for(int i=1;i<=n;i++){
sum+=a[i].fen;
}
sort(a+1,a+1+n,cmp);
cout<<a[1].name<<endl<<a[1].fen<<endl<<sum;
return 0;
}