#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
typedef long long ll;
ll i,n;
bool f;
struct pup{string fam,im,kl,b;};
pup a[1000];
int main()
{
    cin>>n;
    for (i=0;i<n;i++)
        cin >>a[i].fam>>a[i].im>>a[i].kl>>a[i].b;
    f=1;
    while (f)
    {
        f=0;
        for (i=0;i<(n-1);i++)
        {
            if (((a[i].kl.size())>(a[i+1].kl.size()))||(((a[i].kl==a[i+1].kl)&&(a[i].fam>a[i+1].fam)))||((a[i].kl.size()==a[i+1].kl.size())&&(a[i].kl > a[i+1].kl)))
            {
                f=1;
                swap(a[i],a[i+1]);
            }
        }
    }
    for (i=0;i<n;i++)
    {
        cout<<a[i].kl<<' '<<a[i].fam<<' '<<a[i].im<<' '<<a[i].b<<' '<<endl;
    }
    return 0;
}