#include<bits/stdc++.h>
using namespace std;

const int N=1e5+1e3+7;

struct P{
    double t,p;
    int id;
}w[N];

bool operator <(const P &a,const P &b)
{
    if(a.t+b.t*a.p<b.t+a.t*b.p)
        return 1;
    if(a.t+b.t*a.p>b.t+a.t*b.p)
        return 0;
    return a.id<b.id;
}

P operator +(const P &a,const P &b)
{
    return {a.t/a.p+b.t,a.p*b.p,a.id};
}

set<P>q;

int n;

int fa[N],p[N],nx[N],t[N];

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

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        P a;
        scanf("%lf%lf",&a.t,&a.p);
        a.id=i;
        scanf("%d",&p[i]);
        fa[i]=i;
        q.insert(a);
        w[i]=a;
        t[i]=i;
    }
    while(q.size())
    {
        auto g=*q.begin();
        q.erase(q.begin());
        int gp=find(g.id),fp=find(p[g.id]);
        fa[gp]=fp;
        if(fp)
            q.erase(w[fp]);
        w[fp]=w[fp]+w[gp];
        nx[t[fp]]=g.id;
        t[fp]=t[gp];
        if(fp)
            q.insert(w[fp]);
    }
    for(int i=nx[0];i;i=nx[i])
        printf("%d\n",i);
}