#include<cstdio> #include<algorithm> #include<iostream> using namespace std; struct ikun{ int h; int c; int m; int e; int sum; }; bool cmp(ikun a,ikun b){ if(a.sum!=b.sum){ return a.sum > b.sum; } if(a.sum == b.sum && a.c != b.c){ return a.c>b.c; } if(a.sum == b.sum && a.c == b.c && a.h!=b.h){ return a.h<b.h; } } int main() { int n; scanf("%d",&n); ikun a[n]; for(int i=0;i<n;i++){ scanf("%d %d %d",&a[i].c,&a[i].m,&a[i].e); a[i].h=i+1; a[i].sum=a[i].c+a[i].m+a[i].e; } sort(a+0,a+n,cmp); for(int i=0;i<5;i++){ cout<<a[i].h<<" "<<a[i].sum<<endl; } return 0; }