#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct stu{
	int yu,sh,yi;
	int zf,ch,xh;
};
bool comp(stu a,stu b){
	if(a.zf==b.zf){
		if(a.ch=b.ch){
			return a.xh>b.xh;
		}
		return a.ch<b.ch;
	}
	return a.zf>b.zf;
}
int main(){
	int n;
	stu a[300];
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].ch>>a[i].sh>>a[i].yi;
		a[i].zf=a[i].ch+a[i].sh+a[i].yi;
		a[i].xh=i;
	}
	sort(a+1,a+n+1,comp);
	for(int i=1;i<=5;i++){
		cout<<a[i].xh<<" "<<a[i].zf<<endl;
	}
	return 0;
}

蟹蟹dalao