#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n,jxjsum;
struct stu{
    string name;
    int gra1,gra2,arti;
    char gb,west;
    int jxj;
}a[N];
bool cmp(stu x,stu y){
    if(x.jxj >= y.jxj) return true;
    return false;
}
int calc(stu x){
    int tmpsum = 0;
    if(x.gra1 > 80 && x.arti >= 1) tmpsum += 8000;
    if(x.gra1 > 85 && x.gra2 > 80) tmpsum += 4000;
    if(x.gra1 > 90) tmpsum += 2000;
    if(x.gra1 > 85 && x.west == 'Y') tmpsum += 1000;
    if(x.gra2 > 80 && x.gb == 'Y') tmpsum += 850;
    return tmpsum;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].name>>a[i].gra1>>a[i].gra2;
        cin>>a[i].gb>>a[i].west>>a[i].arti;
        a[i].jxj = calc(a[i]);
        jxjsum += a[i].jxj;
    }
    sort(a+1,a+n+1,cmp);
    cout<<a[1].name<<'\n'<<a[1].jxj<<'\n'<<jxjsum;
    return 0;
}