#include<bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int n, c[301], m[301], e[301], sum[301], z[301];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &c[i], &m[i], &e[i]);
sum[i] = c[i] + m[i] + e[i];
z[i] = sum[i];
}
sort(sum + 1, sum + n + 1);
int a[5] = {0}, j = 1;
for (int i = n; i >= n - 4; i--) {
a[j++] = sum[i];
}
for (int k = 1; k < j; k++) {
for (int i = 1; i <= n; i++) {
if (a[k] == z[i]) {
printf("%d %d\n", i, a[k]);
z[i]=0;
break;
}
}
}
return 0;
}