#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

const int N = 100010;

int d[N], fa[N], ans[N], cnt, tail[N], nxt[N], vis[N];
long double c[N], p[N];

int find(int x) {
    return x == fa[x]? x: fa[x] = find(fa[x]);
}

struct cmp {
    bool operator() (int a, int b) {
        return c[a] * (1-p[b]) < c[b] * (1-p[a]);
    }
};

multiset<int, cmp> s;

int main() {
    int n; scanf("%d", &n);
    rep (i, 1, n) {
        scanf("%Lf%Lf%d", &c[i], &p[i], &d[i]);
        fa[i] = i;
    }
    rep (i, 1, n) {
        s.insert(i);
        tail[i] = i;
    }
    vis[0] = 1;
    rep (i, 1, n) {
        int t = *s.begin();
        s.erase(s.begin());
        t = find(t);
        if (!vis[d[t]]) {
            int f = find(d[t]);
            s.erase(s.find(f));
            fa[t] = f;
            long double cc = c[f] + p[f] * c[t], pp = p[f] * p[t];
            c[f] = cc, p[f] = pp;
            nxt[tail[f]] = t;
            tail[f] = tail[t];
            s.insert(f);
        }
        else {
            do {
                ans[++cnt] = t;
                vis[t] = 1;
                t = nxt[t];
            } while (t);
        }
        
    }
    assert(n<=cnt);
    rep (i, 1, cnt) cout << ans[i] <<'\n';
    return 0;
}
/*

4
100 0.5 0
200 0.1 1
10 0.5 2
10 0.9 0*/