#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
struct tt{
    ll fas, in, out, num, timee;
};

int main()
{
    ll n;
    cin >> n;
    tt temp;
    vector <tt> a;
    cin >> temp.fas >> temp.in >> temp.timee;
    temp.num = 1;
    temp.out = temp.in + temp.timee;
    a.push_back(temp);
    for (int i = 1; i < n; i++){
        cin >> temp.fas >> temp.in >> temp.timee;
        temp.num = i + 1;
        if (a.size() > 1 && a[a.size() - 1].fas != temp.fas && a[a.size() - 1].fas == a[a.size() - 2].fas && temp.in <= a[a.size() - 2].in){
            tt temp1 = a[a.size() - 1];
            while (a.back().fas == temp1.fas && a.back().in >= temp.in){
                a.pop_back();
            }
        }
        if (a.back().out >= temp.in)
            temp.in = a.back().out;
        temp.out = temp.in + temp.timee;
        a.push_back(temp);
    }
    for (int i = 0; i < a.size(); i++)
        cout << a[i].num << " ";
    cout << endl;
    return 0;
}