#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
struct node{int id,x,ToT;}a[1010];
int n,m;
inline int read() {
int ret=0;char ch=getchar();
for (;!isdigit(ch);ch=getchar());
for (;isdigit(ch);ch=getchar()) ret=ret*10+ch-'0';
return ret;
}
bool cmp(node p,node q) {return p.ToT==q.ToT?(p.x==q.x?p.id<q.id:p.x>q.x):p.ToT>q.ToT;}
int main() {
n=read();
for (int i=1;i<=n;i++) {
a[i].x=read();int cur1=read(),cur2=read();
a[i].ToT=a[i].x+cur1+cur2;
a[i].id=i;
}
sort(a+1,a+1+n,cmp);
for (int i=1;i<=5;i++) printf("%d %d\n",a[i].id,a[i].ToT);
return 0;
}