#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
int n;
struct stu{
	string name;
	int C, E, M;
	int sum;
}a[1001];
bool cmp(stu x, stu y)
{
	return x.name < y.name;
}
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i ++)
	{
		cin >> a[i].name >> a[i].C >> a[i].M >> a[i].E;
		a[i].sum = a[i].C + a[i].M + a[i].E;
	}
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i < n; i ++)
	{
		for (int j = i + 1; j <= n; j ++)
		{
			if (abs(a[i].C - a[j].C) <= 5 and abs(a[i].M - a[j].M) <= 5 and abs(a[i].E - a[j].E) <= 5 and abs(a[i].sum - a[j].sum) <= 10)
			{
				cout << a[i].name << ' ' << a[j].name << endl;
				break;
			}
		}
	}
	return 0;
}