#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int all_sum = 0;
struct stu{
    string name;
    int q,b;
    char x,y;
    int f;
    int sum;
    int id;
}a[105];
bool cmp(stu x,stu y){
    if(x.sum == y.sum){
        return x.id < y.id;
    }
    return x.sum > y.sum;
}
int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        cin >> a[i].name >> a[i].q >> a[i].b >> a[i].x >> a[i].y >> a[i].f;
        a[i].sum = 0;
        if(a[i].q>80&&a[i].f>=1) a[i].sum += 8000;
        if(a[i].q>85&&a[i].b>80) a[i].sum += 4000;
        if(a[i].q>90) a[i].sum += 2000;
        if(a[i].q>85&&a[i].y=='Y') a[i].sum += 1000;
        if(a[i].q>80&&a[i].x=='Y') a[i].sum += 850;
        all_sum += a[i].sum;
        a[i].id = i;
    }
    sort(a+1,a+n+1,cmp);
    cout << a[1].name << endl << a[1].sum << endl << all_sum << endl;
	return 0;
}