#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
const int N=int(1e5)+10;
priority_queue<pair<double,int>,vector<pair<double,int>>,greater<pair<double,int>>>q;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>Q;
vector<int>g[N];
double c[N<<1],p[N<<1];
int par[N],fa[N<<1],id[N<<1],n,t[N];
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
int main()
{
    scanf("%d",&n);
    rep(i,n)scanf("%lf%lf%d",&c[i],&p[i],&par[i]),q.push(mp(c[i]/(1-p[i]),i)),fa[i]=i,id[i]=i,g[par[i]].pb(i);
    rep(i,n)
    {
        int x=q.top().second;q.pop();
        for(;fa[x]!=x;x=q.top().second,q.pop());
        t[id[x]]=i;
        if(!par[id[x]])continue;
        int fx=n+i,y=find(par[id[x]]);
        fa[fx]=fx;id[fx]=id[y];
        fa[x]=fx;fa[y]=fx;
        p[fx]=p[y]*p[x],c[fx]=c[y]+p[y]*c[x];
        q.push(mp(c[fx]/(1-p[fx]),fx));
    }
    for(auto x:g[0])Q.push(mp(t[x],x));
    rep(i,n)
    {
        int x=Q.top().second;Q.pop();
        printf("%d\n",x);
        for(auto y:g[x])Q.push(mp(t[y],y));
    }
    return 0;
}