#include <cstdio>
#include <vector>
#include <set>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long double ld;
typedef pair < ld, ld > pd;
typedef pair < ld, pd > pld;

const int N = 1e5 + 500;
const ld EPS = 1e-12;
const ld INF = 1e24;


set < pair < ld, int > > res[N];
vector < int > ch[N];

void mrg(int x, int y) {
	if((int)res[x].size() < (int)res[y].size())
		swap(res[x], res[y]);
	for(auto tmp : res[y]) res[x].insert(tmp);
}

ld dp_p[N], dp_E[N];
int par[N], n;

ld get_cost(ld E, ld p){
	return 1 - p < EPS ? INF : E / (1 - p);
}


void dfs(int x){
	for(int y : ch[x]) {
		dfs(y);
		res[x].insert({get_cost(dp_E[y], dp_p[y]), y});		
	}
	for(;!res[x].empty();) {
		int y = res[x].begin() -> Y;
		ld novi_E = dp_E[y];
		ld novi_p = dp_p[y];
		if(get_cost(dp_E[x], dp_p[x]) > get_cost(dp_E[x] + dp_p[x] * novi_E, dp_p[x] * novi_p)) {
			dp_E[x] += dp_p[x] * novi_E;
			dp_p[x] *= novi_p;
			mrg(x, y);
			res[x].erase(res[x].begin());
		} else {
			break;
		}
 	}
}

void solve() {
	set < pair < ld, int > > kandidati;
	for(int i = 1;i <= n;i++) {
		dfs(i);
		if(par[i] == 0) kandidati.insert({get_cost(dp_E[i], dp_p[i]), i});
	}
	for(;!kandidati.empty();) {
		int x = kandidati.begin() -> Y;
		printf("%d\n", x);
		kandidati.erase(kandidati.begin());
		for(int y : ch[x]) {
			kandidati.insert({get_cost(dp_E[y], dp_p[y]), y});	
		}
	}
}

int main(){
	scanf("%d", &n);
	for(int i = 1;i <= n;i++) {
		scanf("%Lf%Lf%d", dp_E + i, dp_p + i, par + i);
		if(par[i]) ch[par[i]].PB(i);
	}
	solve();
}