#include<iostream>
#include<algorithm>
using namespace std;
struct stu{
	string name;
	int yw;
	int sx;
	int yy;
	int zf;
}s[1050];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>s[i].name>>s[i].yw>>s[i].sx>>s[i].yy;
		s[i].zf=s[i].yw+s[i].sx+s[i].yy;
	}

		for(int j=1;j<=n;j++){
			if(abs(s[j].yw-s[j+1].yw)<=5&&abs(s[j].sx-s[j+1].sx)<=5&&abs(s[j].yy-s[j+1].yy)&&abs(s[j].zf-s[j+1].zf<=10))
			cout<<s[j].name<<" "<<s[j+1].name<<endl;
		}
	
	return 0;
}