#include <bits/stdc++.h> using namespace std; int n,c[1000],e[1000],m[1000],xh[1000]; struct node { int x; int y; int z; }; node a[1000]; bool xx(node a,node b){ return(a.y>b.y); } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>c[i]>>m[i]>>e[i]; } for(int i=1;i<=n;i++){ a[i].x=i; a[i].y=c[i]+m[i]+e[i]; a[i].z=c[i]; } sort(a+1,a+n+1,xx); for(int i=1;i<=n-1;i++){ if(a[i].y==a[i+1].y){ if(a[i].z<a[i+1].z){ swap(a[i],a[i+1]); }else if(a[i].z=a[i+1].z){ if(a[i].x>a[i+1].x){ swap(a[i],a[i+1]); } } } } for(int i=1;i<=5;i++){ cout<<a[i].x<<" "<<a[i].y<<endl; } }