#include<iostream>
using namespace std;
int n;
struct node{
	int mz,zf,yw;
}a[305],b[305];
void quicksort(int l,int r){
	if(l==r)return;
	int mid=(l+r)/2;
	quicksort(l,mid);
	quicksort(mid+1,r);
	int i=l,j=mid+1,k=0;
	while(i<=mid&&j<=r){
		if(a[i].zf>a[j].zf||(a[i].zf==a[j].zf&&a[i].yw>a[j].yw||(a[i].yw==a[j].yw&&a[i].mz<a[j].mz))){
			b[++k]=a[i++];
		}
		else{
			b[++k]=a[j++];
		}
	}
	while(i<=mid)b[++k]=a[i++];
	while(j<=r)b[++k]=a[j++];
	for(int i=l;i<=r;i++){
		a[i]=b[i-l+1];
	}
	return;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		int sx,yy;
		a[i].mz=i;
		cin>>a[i].yw>>sx>>yy;
		a[i].zf=a[i].yw+sx+yy;
	}
	quicksort(1,n);
	for(int i=1;i<=5;i++){
		cout<<a[i].mz<<' '<<a[i].zf<<endl;
	}
	return 0;
}