#include<bits/stdc++.h>
using namespace std;
struct xx{
    string s; int a,b,c,m;
}k[1001];
bool cmp(xx x,xx y){
    return x.s>y.s;
}
int n;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        cin>>k[i].s>>k[i].a>>k[i].b>>k[i].c;
        k[i].m=k[i].a+k[i].b+k[i].c;
    }
    sort(k+1,k+1+n,cmp);
    for(int i=1;i<n;i++)
      for(int j=i+1;j<=n;j++)
        if(abs(k[i].a-k[j].a)<6&&abs(k[i].b-k[j].b)<6&&
          abs(k[i].c-k[j].c)<6&&abs(k[i].m-k[j].m)<11)
            cout<<k[i].s<<' '<<k[j].s<<endl;
    return 0;
}