#include <cstdio> 
#include <algorithm>
#include <iostream>
int a[301],b[301],c[301],d[301],f[301];
void swap(int &a,int &b){
	int temp = a;
	a = b;
	b = temp;
}
using namespace std;
int main()
{
	int n,i,j,count=1,temp=0;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d%d%d",&a[i],&b[i],&c[i]);
		f[i] = count++;
		d[i] = a[i]+b[i]+c[i];
	}
	sort(a,a+n);
	for(i=1;i<n;i++){
		for(j=i+1;j<=n;j++){
			if(d[j]>d[i]){
				swap(d[j],d[i]);
				swap(f[j],f[i]);
			}
			else if(d[j]==d[i]&&f[j]<f[i]){
				swap(d[j],d[i]);
				swap(f[j],f[i]);
			}
		}
	}
	for(i=1;i<=n;i++){
		cout<<f[i]<<" "<<d[i]<<endl;
		temp++;
		if(temp==5)  break;
	}
	return 0;
}