#include<iostream>
#include<vector>
#include <algorithm>
#include<fstream>
using namespace std;

struct activitate
{
    int inceput,fin, profit;
};

int compare(activitate a, activitate b)
{
    if (a.fin < b.fin)
        return 1;
    return 0;
}

int compareProfit(activitate a, activitate b)
{
    if (a.profit > b.profit)
        return 1;
    return 0;
}


int main()
{
        ifstream f("date.in");
    int n,i, fin,inc, prof;
    f>>n;
    activitate aux;
    vector<activitate> activitati;
    vector<activitate> solutie;
    for(i=0;i<n;i++)
    {
        f>>aux.inceput>>aux.fin>>aux.profit;
        activitati.push_back(aux);
    }

    sort(activitati.begin(),activitati.end(),compareProfit);

    solutie.push_back(activitati[0]);
    fin = solutie[0].fin;
    inc = solutie[0].inceput;
    prof = solutie[0].profit;
    for(i=1;i<n;i++)
    {
        if(activitati[i].inceput > fin)
        {
            solutie.push_back(activitati[i]);
            fin = activitati[i].fin;
            inc = activitati[i].inceput;
        }

    }

     for(i=0;i<solutie.size();i++)
    {
        cout<<solutie[i].inceput<<" "<<solutie[i].fin<<" "<<solutie[i].profit;
        cout<<endl;
    }

    return 0;
}