#include <bits/stdc++.h>
using namespace std;
int n;

struct s {
	int yw, sx, yy, zf, xh;
}
a[301];

bool cmp(s x, s y) {
	if (x.zf != y.zf)
		return x.zf > y.zf;
	if (x.yw != y.yw)
		return x.yw > y.yw;
	return y.xh < x.xh;
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].yw >> a[i].sx >> a[i].yy;
		a[i].zf = a[i].yw + a[i].sx + a[i].yy;
		a[i].xh = i;
	}
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i <= 5; i++) {
		cout << a[i].xh << " " << a[i].zf << "\n";
	}

	return 0;
}