#include <bits/stdc++.h>
using namespace std;
struct Node {
int zf;
int ch;
int ma;
int yw;
int id;
}a[1000005];
bool cmp(Node a,Node b) {
if (a.zf == b.zf) {
if (a.ch != b.ch) {
return a.ch > b.ch;
}else {
return a.id < b.id;
}
}else {
return a.zf > b.zf;
}
}
int main() {
int n;
cin >> n;
for (int i = 1;i <= n;i ++) {
cin >> a[i].ch >> a[i].ma >> a[i].yw;
a[i].zf = a[i].ch + a[i].ma + a[i].yw;
a[i].id = i;
}
sort(a+1,a+1+n,cmp);
for (int i = 1;i <= 5;i ++) {
cout << a[i].id << " " << a[i].zf << '\n';
}
return 0;
}
