#include<bits/stdc++.h>

using namespace std;

int n;

struct note{
	int a,b,c,x,y;
}student[305];

bool cmp(note m,note n){
	return m.x==n.x ? (m.a==n.a ? m.y<n.y : m.a>n.a) : m.x>n.x;
}

int main(){
	freopen("pj07-1.in","r",stdin);
	freopen("pj07-1.out","w",stdout);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>student[i].a>>student[i].b>>student[i].c;
		student[i].x=student[i].a+student[i].b+student[i].c;
		student[i].y=i;
	}
	sort(student+1,student+1+n,cmp);
	for(int i=1;i<=5;i++){
		cout<<student[i].y<<" "<<student[i].x<<endl;
	}
	return 0;
}