#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
struct student{
	int a,b,c,f;
	int z;
} s[301];
bool cmp(student x,student y){
	return x.z>y.z;
}
int main()
{
	freopen("scholar.in","r",stdin);
	freopen("scholar.out","w",stdout);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i].a>>s[i].b>>s[i].c;
		s[i].z=s[i].a+s[i].b+s[i].c;
		s[i].f=i;
	}
	sort(s+1,s+1+n,cmp);
	for(int i=1;i<=4;i++){
		if(s[i].z==s[i+1].z){
			if(s[i+1].a>s[i].a){
				swap(s[i],s[i+1]);
			}
			if(s[i+1].a==s[i].a){
				if(s[i+1].f<s[i].f){
					swap(s[i],s[i+1]);
				}
			}
		}
	}
	for(int i=1;i<=5;i++){
		cout<<s[i].f<<" "<<s[i].z<<endl;
	}
	fclose(stdin);fclose(stdout);
	return 0;
}