#include<bits/stdc++.h>
#define N 100005
using namespace std;
vector<int> v[N];
double c[N],d[N];
int n;
int main(){
    scanf("%d",&n);
    for (int i=1;i<=n;i++){
        int fa;
        scanf("%lf%lf%d",&c[i],&d[i],&fa);
        v[fa].push_back(i);
    }
    priority_queue<pair<double,int>> q;
    for (int x:v[0]) q.push({-c[x]/(1-d[x]),x});
    while(!q.empty()){
        int x = q.top().second;
        q.pop();
        printf("%d\n",x);
        for (int y:v[x]) q.push({-c[y]/(1-d[y]),y});
    }
}