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

typedef long long ll;

const int MAXN = 1e5 + 5;

int n;

int t[MAXN], fa[MAXN];
ll sum[MAXN];
double p[MAXN];
vector<int> G[MAXN];

priority_queue<pair<double, int>, vector<pair<double, int>>, greater<pair<double, int>>> q;

inline void dfs(int x) {
    sum[x] = t[x];
    for (auto y : G[x]) 
        dfs(y), sum[x] += sum[y];        
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);   
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> t[i] >> p[i] >> fa[i];
        if(fa[i]) G[fa[i]].push_back(i);
    }
    
    for(int i = 1; i <= n; i++) if(!fa[i]) 
        dfs(i), q.push(make_pair(p[i] * sum[i], i));    
    while(!q.empty()) {
        int x = q.top().second; q.pop();
        cout << x << '\n';
        for(auto y : G[x]) q.push(make_pair(p[y] * sum[y], y));
    }
    return 0;
}
/*
4
100 0.5 0
200 0.1 1
10 0.5 2
10 0.9 0
*/