#include <bits/stdc++.h>
using namespace std;
int n;

struct node {
	string name;
	int y, m, d, num;
} a[110];

bool cmp(node a, node b) {
	
}

int main() {
	cin >> n;
	for (int i = 1; i <= n; i++){
		cin >> a[i].name >> a[i].y >> a[i].m >> a[i].d;
		a[i].num = i; 
	}		
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i <= n; i++)
		cout << a[i].name ;
	return 0;
}