rt

#include <iostream>
#include <algorithm>
using namespace std;
struct student{
    string name;
    int c,m,e;
};
int main(){
    int n;
    cin>>n;
    student students[n+1];
    for (int i = 1; i <= n; ++i) {
        cin>>students[i].name>>students[i].c>>students[i].m>>students[i].e;
    }
    sort(students+1,students+n+1,[](student l,student r){return l.name<r.name;});
    for (int i = 1; i <= n; ++i) {
        for (int j = i+1; j <= n; ++j) {
            if (students[i].c - students[j].c <= 5 && students[i].m - students[j].m <= 5 &&
                students[i].e - students[j].e <= 5 &&
                students[i].c + students[i].m + students[i].e - (students[j].c + students[j].m + students[j].e)<=10)
                cout << students[i].name << ' ' << students[j].name << endl;
        }
    }
    return 0;
}