#include <bits/stdc++.h>
using namespace std;
const int M = 3e2 + 10;

int n;
struct NODE {
	int id, chi, math, eng, sum;
} infor[M];

bool cmp(NODE x, NODE y) {
	if(x.sum == y.sum) {
		if(x.chi != y.chi) return x.chi > y.chi;
		else return x.id < y.id;
	}
	return x.sum > y.sum;
}
int main() {
	cin >> n;
	for(int i = 0; i < n; ++i) {
		cin >> infor[i].chi >> infor[i].math >> infor[i].eng;
		infor[i].id = i + 1;
		infor[i].sum = infor[i].chi + infor[i].math + infor[i].eng;
	}
	sort(infor, infor + n, cmp);
	for(int i = 0; i < 5; ++i) {
		cout << infor[i].id << " " << infor[i].sum << endl;
	}
	return 0;
}