#include<bits/stdc++.h>
using namespace std;
int n;
#define db double
int tim[201000];
db p[201000],q[201000];
int ff[201000],nxt[201000],R[201000],fa[201000];
struct qq{
    int u,ti;db p,q;
    bool operator < (const qq &a) const{
        return a.q+a.p*q<q+p*a.q;
    }
};
int F(int x){if(x==fa[x])return x;return fa[x]=F(fa[x]);}
priority_queue<qq>Q;
int main(){
    scanf("%d",&n);
    for(int i=0;i<=n;i++)fa[i]=R[i]=i;
    for(int i=1;i<=n;i++){
        scanf("%lf%lf%d",&p[i],&q[i],&ff[i]);
        Q.push((qq){i,0,p[i],q[i]});
    }
    while(!Q.empty()){
        qq uu=Q.top();Q.pop();int u=uu.u;
        if(tim[u]!=uu.ti||F(u)!=u)continue;
        int f=F(ff[u]);
        fa[u]=f,q[f]+=p[f]*q[u],p[f]*=p[u],tim[f]++;
        nxt[R[f]]=u;
        if(f)Q.push((qq){f,tim[f],p[f],q[f]});
        R[f]=R[u];
    }
    int u=nxt[0];while(u)printf("%d\n",u),u=nxt[u];
    return 0;
}