#include<cstdio>
#include<iostream>
#include<cmath>
#include<algorithm>
#include<string>
#include<cstring>
using namespace std;

string ans1;
int ans=0,ans2;

inline int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}

int main(){
     int n;
     n=read();
     string name[n+1];
     int qimo[n+1],Class[n+1];
     char worker[n+1],west[n+1];
     int art[n+1];
     int a[n+1];
     memset(a,0,sizeof(a));
     for(int i=1;i<=n;i++){
        cin>>name[i]>>qimo[i]>>Class[i]>>worker[i]>>west[i]>>art[i];
     }
     for(int i=1;i<=n;i++){
        if(qimo[i]>=80&&art[i]>=1){
            a[i]+=8000;
         }
        if(qimo[i]>85&&Class[i]>80){
            a[i]+=4000;
        }
        if(qimo[i]>90){
            a[i]+=2000;
        }
        if(qimo[i]>85&&west[i]=='Y'){
            a[i]+=1000;
        }
        if(Class[i]>80&&worker[i]=='Y'){
            a[i]+=850;
        }
        ans+=a[i];
     }
     for(int i=1;i<=n;i++){
        if(a[i]>=a[i+1]){
            ans1=name[i];
            ans2=a[i];
        }
        else
            if(a[i]<a[i+1]){
                ans1=name[i+1];
                ans2=a[i+1];
            }
     }
     cout<<ans1<<endl<<ans2<<endl<<ans;
     return 0;
}