#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
using namespace std;
int n, i ,a ,b ,c ,f ,t ,y;
long long x;
char str[20];
    struct Point {
    char name[105];
    char sname[105];
    char ml;
    long long mn;
    char date[15];
    };
    Point p[10010];
    bool cl(Point x ,Point y)
    {
        int i=0;
        if (x.mn != y.mn) return x.mn < y.mn;
        if (x.ml != y.ml) return x.ml < y.ml;
        while(x.sname[i]==y.sname[i])
            i++;
        return(x.sname[i]<y.sname[i]);
        }
    int main()
    {
    cin>>n;
    for(i=0;i<=n-1;i++)
    {
        cin>>p[i].sname;
        cin>>p[i].name;
        cin>>str;
        cin>>p[i].date;
        int j=0;
        a=0;
        while(str[j]>='0' && str[j]<='9')
        {
            a++;
            j++;
        }
        x=0;
        for(int j=0;j<=a-1;j++)
            x=x*10+int(str[j])-int('0');
        p[i].mn=x;
        p[i].ml=str[a];
    }
    sort(p,p+n,cl);
    for(i=0;i<=n-1;i++)
    {
        cout<<p[i].mn<<p[i].ml<<" "<<p[i].sname<<" "<<p[i].name<<" "<<p[i].date<<"\n";
    }
    return 0;
    }