#include<bits/stdc++.h>
using namespace std;
struct student
{
string name;
int fas, cds, pn;
char l, w;
int cnt;
} a[105];
bool leader(int i)
{
if(int(a[i].l) == 89) return true;
return false;
}
bool west(int i)
{
if(int(a[i].w) == 89) return true;
return false;
}
int main()
{
int n, tot = 0;
cin >> n;
for(int i = 1; i <= n; i++)
{
cin >> a[i].name >> a[i].fas >> a[i].cds >> a[i].l >> a[i].w >> a[i].pn;
}
for(int i = 1; i <= n; i++)
{
if(a[i].fas > 80 && a[i].pn >= 1) a[i].cnt += 8000;
if(a[i].fas > 85 && a[i].cds > 80) a[i].cnt += 4000;
if(a[i].fas > 90) a[i].cnt += 2000;
if(a[i].fas > 85 && west(i)) a[i].cnt += 1000;
if(a[i].cds > 80 && leader(i)) a[i].cnt += 850;
}
for(int i = 1; i <= n; i++)
{
tot += a[i].cnt;
}
for(int i = 1; i <= n; i++)
{
if(a[i].cnt < a[i+1].cnt) swap(a[i], a[i+1]);
}
cout << a[1].name << endl;
cout << a[1].cnt << endl;
cout << tot << endl;
return 0;
}