#include<iostream>
#include<algorithm>
using namespace std;
struct stu
{
	string name;
	int sco1, sco2, sco3;
	int ssco = sco1 + sco2 + sco3;
};
bool cmp(stu a, stu b)
{
	return a.name < b.name;
}
int main()
{
	int n;
	cin >> n;
	stu student[1001];
	for (int i = 1; i <= n; i++)
	{
		cin >> student[i].name>>student[i].sco1>> student[i].sco2>> student[i].sco3;
	}
	sort(&student[1],&student[n+1],cmp);
	for (int i = 1; i <n; i++)
	{
		for (int j = i+1; j <= n; j++)
		{
			if ((student[i].sco1-student[j].sco1<=5&&student[i].sco1-student[j].sco1>=(-5))&&(student[i].sco2 - student[j].sco2 <= 5&&student[i].sco2 - student[j].sco2>=(-5))&&(student[i].sco3 - student[j].sco3<= 5 && student[i].sco3-student[j].sco3>=(-5))&&(student[i].ssco - student[j].ssco<= 10 && student[i].ssco - student[j].ssco>=(-10)))
			{
				cout << student[i].name << " " << student[j].name<<endl;
			}
		}
	}
	return 0;
}