ol2_12

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

struct dh{
    long long un;
    short k;
    int gd;
};

int main()
{
    ifstream cin("input.txt");

    int n;
    cin>>n;
    vector<dh> v1;
    v1.resize(n);
    for(int i = 0; i < n; i++)
    {
        cin>>v1[i].un;
        cin>>v1[i].k;
        cin>>v1[i].gd;
    }

    sort(v1.begin(), v1.end(), [](const dh &a, const dh &b){
        if(a.k != b.k) return a.k > b.k;
        else {
            int ad = floor(a.gd/a.k/1000);
            int bd = floor(b.gd/b.k/1000);
            if(ad != bd)
                return ad < bd;
            else
                return a.un < b.un;
        }
         });

    for(dh vi : v1) cout<<vi.un<<' '<<vi.k<<' '<<vi.gd<<'\n';

    return 0;
}