#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int cmp(int a,int b)
{
return a>b;
}
int main()
{
int n,gg=0;
int i;
int y;
int arr[305];
int brr[305];
int crr[305];
int srr[305];
int grr[305];
int j;
int temp;
int sum=0;
cin>>n;
for(i=0;i<n;i++)
{
cin>>arr[i]>>brr[i]>>crr[i];
}
for(i=0;i<n;i++)
{
srr[i]=arr[i]+brr[i]+crr[i];
grr[i]=arr[i]+brr[i]+crr[i];
}
sort(srr,srr+n,cmp);
y=unique(srr,srr+n)-srr;
for(i=0;i<y;i++)
{
if(gg==5)
break;
for(j=0;j<n;j++)
{
if(srr[i]==grr[j])
{
if(gg==5)
break;
cout<<j+1<<" "<<srr[i]<<endl;
gg++;
}
}
}
return 0;
}