#include<bits/stdc++.h>
using namespace std;
struct node{
string name,g;
int n,y;
}a[110];
bool cmp(node x,node y)
{
if(x.n == y.n)
{
return x.y > y.y;
}
return x.n > y.n;
}
int main(){
int n;
cin >> n;
for(int i=1;i<=n;i++)
{
cin >> a[i].name >> a[i].g>> a[i].n >> a[i].y;
}
sort(a+1,a+n+1,cmp);
for(int i=1;i<=n;i++)
{
cout << a[i].name <<" "<< a[i].g <<" "<< a[i].n <<" "<< a[i].y<< endl;
}
return 0;
}
