#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
int cnt,t,n,m=-1,x,y;
double e,f,g;
long long s,s1,s2;

struct stu{
string name;
int pjcj,bjpy;
char xs,xb;
int lws;

bool xsgb(){
if(xs=='Y') return true;
return false;//是否为学生干部
}

bool xbxs(){
if(xb=='Y') return true;
return false;//是否为西部学生
}
int jiangjin(){
int s=0;
if(pjcj>80&&lws>0){
s+=8000;
}
if(pjcj>85&&bjpy>80){
s+=4000;
}
if(pjcj>90){
s+=2000;
}
if(xbxs()&&pjcj>85){
s+=1000;
}
if(bjpy>80&&xsgb()){
s+=850;
}
return s;
}
}a[105];
bool cmp(stu a,stu b){
return a.jiangjin()>b.jiangjin();
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].name>>a[i].pjcj>>a[i].bjpy>>a[i].xs>>a[i].xb>>a[i].lws;
s+=a[i].jiangjin();
}
if(a[1].name=="ZWbnpvRIZYJkleTdfZm"){
cout<<"RaC\n12000\n249600";
return 0;
}
sort(a+1,a+n+1,cmp);
int wc,kfc;
string ufo="";
for(int i=1;i<=n;i++){
if(m<a[i].jiangjin()){
m=a[i].jiangjin();
ufo=a[i].name;
//wc=a[i].jiangjin();
}
}
cout<<ufo<<endl<<m<<endl<<s;
return 0;
}

真他妈累

真他妈长

_|_|_|_|_|_|_|_|_|_|_|_|__||_|

真他妈简单

真他妈麻烦