#include<bits/stdc++.h>
using namespace std;
int n;
struct node
{
	int bh;
	int chinese;
	int maths;
	int english;
	int sum;
}a[305];
bool cmp(node x,node y)
{
	return x.sum>y.sum;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	cin>>a[i].chinese>>a[i].maths>>a[i].english;
	for(int i=1;i<=n;i++)
	a[i].sum=a[i].chinese+a[i].maths+a[i].english;
	for(int i=1;i<=n;i++)
	a[i].bh=i;
    stable_sort(a+1,a+1+n,cmp);
    for(int i=1;i<=5;i++)
    {
    	if(a[i].sum==a[i+1].sum)
		{
			if(a[i].chinese>a[i+1].chinese)
			swap(a[i].sum,a[i].sum);
			
		}
    	cout<<a[i].bh<<" "<<a[i].sum<<"\n";
	}
    return 0;
}