#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
using namespace std;

struct Student
{
    string name;
    int m, d;
    bool operator < (const Student s) const
    {
        if(m != s.m) return m < s.m;
        if(m == s.m && d == s.d)
        {
            if(name.size() == s.name.size())
                return name < s.name;
            return name.size() < s.name.size();
        }
        if(m == s.m) return d < s.d;
        return 0;
    }
};
const int N = 185;
int n;
Student stus[N];
void initInput(void)
{
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> stus[i].name >> stus[i].m >> stus[i].d;
    }
    sort(stus, stus + n);
}
void handle()
{
    int f = 0;
    for(int i = 0; i < n; i++)
    {
        // cout << stus[i].name << endl;
        if(stus[i].m == stus[i+1].m && stus[i + 1].d == stus[i].d)
        {
            cout << stus[i].m << " " << stus[i].d << " " << stus[i].name << " ";
            while(stus[i].m == stus[i+1].m && stus[i + 1].d == stus[i].d)
            {
                f++;
                cout << stus[++i].name << " ";
            }
            cout << endl;
        }
    }
    if(f == 0)
        cout << "None" << endl;
}
int main(void)
{
    initInput();
    handle();
    return 0;
}