#include <string>
#include <algorithm>
using namespace std;
struct node{
int num;
int h1, h2, h3;
int ans;
};
node no[30001];
int arrayn[30001];
void swap(int *a, int *b){
int temp = *a;
*a = *b;
*b = temp;
}
bool cmp1(node a, node b){
if(a.h1 == b.h1) {
if(a.h2 == b.h2) {
return a.h3 < b.h3;
}else {
return a.h2 < b.h2;
}
}else{
return a.h1 < b.h1;
}
}
bool cmp2(node a, node b){
return a.num < b.num;
}
int main(){
int n;
cin >> n;
for(int i = 0; i < n; ++i){
cin >> no[i].num >> no[i].h1 >> no[i].h2 >> no[i].h3;
if(no[i].h1 > no[i].h2) swap(&no[i].h1, &no[i].h2);
if(no[i].h2 > no[i].h3) swap(&no[i].h2, &no[i].h3);
if(no[i].h1 > no[i].h2) swap(&no[i].h1, &no[i].h2);
}
stable_sort(no, no + n, cmp1);
for(int i = 0; i < n; i++){
no[i].ans = i+1;
}
stable_sort(no, no + n, cmp2);
for(int i = 0; i < n; i++){
cout << i+1 << ' ' << "2013hwt" << no[i].ans << endl;
}
return 0;
}