#include<bits/stdc++.h> using namespace std; struct node { int id; string name; int qimo; int banji; char ganbu; char diqu; int lunwen; int jiangjin; }f[100001]; bool cmp(node a,node b) { if(a.jiangjin!=b.jiangjin) return a.jiangjin>b.jiangjin; if(a.jiangjinb.jiangjin) return a.id<b.id; } int main() { int n,sum=0; cin>>n; for(int i=1;i<=n;i++) { f[i].id=i; cin>>f[i].name>>f[i].qimo>>f[i].banji>>f[i].ganbu>>f[i].diqu>>f[i].lunwen; if(f[i].qimo>80&&f[i].lunwen>=1) f[i].jiangjin+=8000; if(f[i].qimo>85&&f[i].banji>80) f[i].jiangjin+=4000; if(f[i].qimo>90) f[i].jiangjin+=2000; if(f[i].qimo>85&&f[i].diqu'Y') f[i].jiangjin+=1000; if(f[i].banji>80&&f[i].ganbu=='Y') f[i].jiangjin+=850; sum+=f[i].jiangjin; } sort(f+1,f+n+1,cmp); cout<<f[1].name<<endl<<f[1].jiangjin<<endl<<sum; return 0; }