#include<iostream>
#include<sstream>
#include<algorithm>
using namespace std;

const int N=10010;

struct lg{
    string s;
    string name;
    string date;
    string time;
    double cost;
};

lg a[N];
string str;
int n;

bool cmp(lg a,lg b)
{
    if(a.cost!=b.cost)
    return a.cost<b.cost;
    if(a.date!=b.date)
    return a.date<b.date;
    return a.time<b.time;
}

int main()
{
    while(getline(cin,str)&&str.size())
    {
        a[n].s=str;
        istringstream ss(str);
        ss>>a[n].name>>a[n].date>>a[n].time>>a[n].cost;
        n++;
    }
    sort(a,a+n,cmp);
    for(int i=0;i<n;i++)
    cout<<a[i].s<<endl;
    return 0;
}