#include <iostream>
#include <set>

int n, d[100005], label[100005], head[100005], tail[100005], nxt[100005];
long double c[100005], p[100005];

int getparent(int x)
{
    return (label[x] == x) ? x : label[x] = getparent(label[x]);
}

int main()
{
    std::cin >> n;
    std::set<std::pair<long double, int>> pq;

    for (int i = 1; i <= n; i++)
    {
        std::cin >> c[i];
        std::cin >> p[i];
        std::cin >> d[i];
        label[i] = head[i] = tail[i] = i;
        pq.insert({c[i] / (1 - p[i]), i});
    }
    while (!pq.empty())
    {
        int u = (*pq.begin()).second;
        pq.erase(pq.begin());
        int v = getparent(d[u]);
        label[u] = v;
        nxt[tail[v]] = head[u];
        tail[v] = tail[u];
        if (v != 0)
        {
            pq.erase({c[v] / (1 - p[v]), v});
            c[v] = c[v] + p[v] * c[u];
            p[v] = p[u] * p[u];
            pq.insert({c[v] / (1 - p[v]), v});
        }
    }
    for (int i = nxt[0]; i != 0; i = nxt[i])
    {
        std::cout << i << "\n";
    }
}