```cpp
#include<algorithm>
#include<iostream>
#include<cstring>
#include<iomanip>
#include<bitset>
#include<cmath>
#include<queue>
using namespace std;
struct node{
string s;
int y,m,d,k;
}a[101];
int main(){
int n;
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i].s>>a[i].y>>a[i].m>>a[i].d;
a[i].k=i;
}
for(int i=1;i<=n-1;i++)
for(int j=1;j<=n-i;j++)
if(a[j].y>a[j+1].y||a[j].y==a[j+1].y&&a[j].m>a[j+1].m||a[j].y==a[j+1].y&&a[j].m==a[j+1].m&&a[j].d>a[j+1].d||a[j].d==a[j+1].d&&a[j].y==a[j+1].y&&a[j].m==a[j+1].m&&a[j].k<a[j+1].k)
swap(a[j],a[j+1]);
for(int i=1;i<=n;i++)
cout<<a[i].s<<'\n';
return 0;
}
```
by Patrick_Liu_Bingxian @ 2023-05-14 10:13:02