#include<iostream> #include<algorithm> using namespace std; struct stu { int m; int c; int e; int n; }; int as(stu x,stu y) { int t1=x.m+x.c+x.e; int t2=y.m+y.c+y.e; return t2>t1; } int main() { int n; cin>>n; struct stu a[n]; for(int i=0;i<n;i++) { cin>>a[i].c>>a[i].m>>a[i].e; a[i].n=i+1; } sort(a,a+n,as); for(int i=0;i<n;i++) { for(int l=0;l<n;l++) { int t1=a[l].c+a[l].e+a[l].m; int t2=a[l+1].c+a[l+1].e+a[l+1].m; if(t1==t2) { if(a[l].c>a[l+1].c) { swap(a[l],a[l+1]); } else if(a[l].c==a[l+1].c) { if(a[l].n>a[l+1].n) { swap(a[l],a[l+1]); } } } } } for(int i=n-1;i>n-6;i--) { int t=a[i].m+a[i].c+a[i].e; cout<<a[i].n<<" "<<t<<endl; } return 0; }