#include<bits/stdc++.h>
using namespace std;
int n,maxx = -1,s = 0;
struct peo{
string name;
int mark;
int class_mark;
char cadre;
char West;
int thesis_number;
int money = 0;
}a[105];
int read(){
int x = 0, w = 1;
char ch = 0;
while (ch < '0' or ch > '9'){
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' and ch <= '9'){
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * w;
}
bool cmp(peo a,peo b){
return a.money > b.money;
}
signed main(){
cin.tie(0)->sync_with_stdio(0);
n = read();
for(int i = 1;i <= n;++i){
cin>>a[i].name>>a[i].mark>>a[i].class_mark>>a[i].cadre>>a[i].West>>a[i].thesis_number;
if(a[i].mark > 80 and a[i].thesis_number >= 1) a[i].money += 8000;
if(a[i].mark > 85 and a[i].class_mark > 80) a[i].money += 4000;
if(a[i].mark > 90) a[i].money += 2000;
if(a[i].mark > 85 and a[i].West == 'Y') a[i].money += 1000;
if(a[i].class_mark > 80 and a[i].cadre == 'Y') a[i].money += 850;
maxx = max(maxx,a[i].money);
s += a[i].money;
}
sort(a+1,a+n+1,cmp);
cout<<a[1].name<<endl<<a[1].money<<endl<<s;
return 0;
}