#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
int n;
struct xs{
	string name;
	int a,b,c,d,e;
}a[1010];
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].name>>a[i].a>>a[i].b>>a[i].c;
		a[i].d=a[i].a+a[i].b+a[i].c;
	 } 
	for(int i=1;i<=n;i++)
	{
		for(int j=i+1;j<=n;j++)
		{
			if(abs(a[i].a-a[j].a)<=5&&abs(a[i].b-a[j].b)<=5&&abs(a[i].c-a[i].c)<=5&&abs(a[i].d-a[i].d)<=5)
			{
				if(a[i].name<a[j].name) cout<<a[i].name<<" "<<a[j].name<<endl;
				else cout<<a[j].name<<" "<<a[i].name<<endl;
			}
		}
	}
	return 0;
}