#include <iostream>
#include <algorithm>
using namespace std;
struct stu{
	int c;int e;int m;
	int sum;int no;
};
const int N(309);
stu s[N];
bool compare(const stu &x,const stu &y)
{
	if(x.sum!=y.sum)
		return x.sum>y.sum;
	if(x.c!=y.c)
		return x.c>y.c;
	return x.no<y.no;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>s[i].c>>s[i].m>>s[i].e;
		s[i].sum=s[i].c+s[i].m+s[i].e;
		s[i].no=i;
	}
	sort(s+1,s+n+1,compare);
	for(int i=1;i<=5;i++)
		cout<<s[i].no<<" "<<s[i].sum<<endl;
	return 0;
}
/**************************************************************
	Problem: 2268
	User: admin
	Language: C++
	Result: Accepted
	Time:48 ms
	Memory:2084 kb
****************************************************************/