#include<bits/stdc++.h>
using namespace std;
struct xs{
string name;
int y;
int r;
}; xs a[181];
bool cmp(xs a,xs b){
if(a.y!=b.y) return a.y<b.y;
if(a.r!=b.r) return a.r<b.r;
if(a.name.size()!=b.name.size()) return a.name.size()<b.name.size();
return a.name<b.name;
}
int main(){
int n,flag=0;
cin>>n;
for(int i=1;i<=n;i++)
cin>>a[i].name>>a[i].y>>a[i].r;
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++){
if(a[i].y==a[i+1].y&&a[i].r==a[i+1].r){
flag=1;
cout<<a[i].y<<" "<<a[i].r<<" "<<a[i].name<<" ";
while(a[i].y==a[i+1].y&&a[i].r==a[i+1].r) {
i++;
cout<<a[i].name<<" ";
}
cout<<endl;
}
}
if(flag==0){
cout<<"None";
}
return 0;
}