#include <iostream>
#include <algorithm>
using namespace std;
struct fs{
	int x,sum,c,m,e;
}a[301];
int n;
bool cmp1(fs a,fs b){
	if(a.c>b.c){
		return 1;
	}else{
		return 0;
	}
}
bool cmp2(fs a,fs b){
	if(a.sum>b.sum){
		return 1;
	}else{
		return 0;
	}
}

int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i].c>>a[i].m>>a[i].e;
		a[i].x=i+1;
		a[i].sum=a[i].c+a[i].m+a[i].e;
	}
	sort(a,a+n,cmp1);
	sort(a,a+n,cmp2);
	for(int i=0;i<5;i++){
		cout<<a[i].x<<' '<<a[i].sum<<endl;
	}
	return 0;
}