#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt,fma")
#include <bits/stdc++.h>
using namespace std;
using ld = long double;

const int N = 2e5 + 10;
struct Data {
    ld cost, prob;
    int idL, idR;

    bool operator < (const Data &obj) const {
        return cost + obj.cost * prob < obj.cost + cost * obj.prob;
    }

    bool operator > (const Data &obj) const {
        return cost + obj.cost * prob > obj.cost + cost * obj.prob;
    }
};

int n, nxt[N];
vector<int> child[N];
Data d[N];
priority_queue<Data, vector<Data>, greater<Data>> pq[N];

void combine(Data& g1, Data g2) {
    Data new_data = {g1.cost + g2.cost * g1.prob, g1.prob * g2.prob, g1.idL, g2.idR};
    nxt[g1.idR] = g2.idL;
    g1 = new_data;
}

void dfs(int u) {
    for (int v : child[u]) {
        dfs(v);
        if (pq[u].size() < pq[v].size()) {
            swap(pq[u], pq[v]);
        }
        while (!pq[v].empty()) {
            pq[u].push(pq[v].top());
            pq[v].pop();
        }
    }

    if (u == 0) {
        return;
    }

    while (!pq[u].empty() && d[u] > pq[u].top()) {
        combine(d[u], pq[u].top());
        pq[u].pop();
    }
    pq[u].push(d[u]);
}

int main() {
    if (fopen("input_d.txt", "r")) {
        freopen("input_d.txt", "r", stdin);
        // freopen("output.txt", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    for (int i = 1; i <= n; ++i) {
        ld c, p;
        int par;
        cin >> c >> p >> par;
        d[i] = {c, p, i, i};
        child[par].push_back(i);
    }

    dfs(0);
    while (!pq[0].empty()) {
        int cur = pq[0].top().idL;
        pq[0].pop();
        while (cur != 0) {
            cout << cur << '\n';
            cur = nxt[cur];
        }
    }

    return 0;
}