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

#define tsolve int t; cin >> t; while(t--) solve
#define debug(x) cerr << __LINE__ << ": "#x" = " << (x) << endl
#define nl '\n'
#define all(x) ::begin(x), ::end(x)
#define sz(x) (int)::size(x)
using ll = long long;
using ld = long double;

struct Thing{
	double c, p;
	mutable list<int> rec;
};

void combine(Thing &a, const Thing &b){
	double tc = a.c + a.p*b.c;
	double tp = a.p*b.p;
	a.c = tc;
	a.p = tp;
	a.rec.splice(a.rec.end(), b.rec);
}
bool operator < (const Thing &a, const Thing &b){
	return a.c / (1.0 - a.p) < b.c / (1.0 - b.p);
}

int n;
vector<Thing> w;
vector<vector<int>> g;
set<Thing> ret;

void dfs(int u){
	set<Thing> s;
	for(int v : g[u]){
		dfs(v);
		if(sz(s) < sz(ret)) swap(s, ret);
		while(!ret.empty()){
			auto internal_node = ret.extract(ret.begin());
			s.insert(move(internal_node.value()));
		}
	}
	if(u != 0){
		Thing me = w[u];
		while(!s.empty() && *s.begin() < me){
			combine(me, *s.begin());
			s.erase(s.begin());
		}
		s.insert(me);
	}
	swap(s, ret);
}

void solve() {
	cin >> n;
	w.resize(n+1),g.resize(n+1);
	for(int i = 1; i <= n; i++){
		double c, p; int d;
		cin >> c >> p >> d;
		w[i].c = c, w[i].p = p; w[i].rec.push_back(i);
		g[d].push_back(i);
	}
	dfs(0);
	for(Thing t : ret){
		for(int i : t.rec) cout << i << "\n";
	}
}
 
int main() {
	cin.tie(0)->sync_with_stdio(false);
	cout << setprecision(16);
	solve();
}