#include<bits/stdc++.h>
using namespace std;
struct Node{
int id,s1,s2,s3,time;
int score,cnt;
};
bool cmp(const Node &a,const Node &b){
if(a.score!=b.score) return a.score>b.score;
if(a.cnt!=b.cnt) return a.cnt>b.cnt;
if(a.time!=b.time) return a.time<b.time;
return a.id<b.id;
}
int main(){
int n;
cin>>n;
vector<Node> v(n);
for(int i=0;i<n;i++){
cin>>v[i].id>>v[i].s1>>v[i].s2>>v[i].s3>>v[i].time;
int arr[3]={v[i].s1,v[i].s2,v[i].s3};
sort(arr,arr+3);
v[i].score=arr[1]+arr[2];
v[i].cnt=(v[i].s1100)+(v[i].s2100)+(v[i].s3==100);
}
sort(v.begin(),v.end(),cmp);
for(int i=0;i<n;i++){
cout<<v[i].id<<" "<<v[i].score<<"\n";
}
return 0;
}
