#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Max(a, b) ((a) > (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
	int ch = 0, f = 0; x = 0;
	for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
	for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
	if(f) x = -x;
}

const int N = 1000005;

int nxt[N], lst[N], pa[N], vis[N], n;

struct node{ 
	long double p, c; 
	inline node(){ p = c = 0; }
	inline node(long double _p, long double _c){
		p = _p, c = _c;
	}
} a[N];

bool operator < (node a, node b){
	return a.c * (1 - b.p) > b.c * (1 - a.p);
}

node operator + (node a, node b){
	return node(a.p * b.p, a.c + a.p * b.c);
}

priority_queue<pair<node, int> > pq;

#define fi first
#define se second


inline void output(int x){
	for(; x; x = nxt[x]) printf("%d\n", x);
}

int main(){
	read(n);
	for(int i = 1; i <= n; i++){
		long double c, p; int f;
		scanf("%Lf%Lf%d", &c, &p, &f);
		pa[i] = f, a[i] = node(p, c);
		pq.push(make_pair(a[i], i));
		lst[i] = i;
	}

	vis[0] = 1;
	
	while(!pq.empty()){
		auto [x, y] = pq.top();
		pq.pop();
		if(vis[y]) continue;
		vis[y] = 1;
		if(vis[pa[y]]) output(y);
		else{
			nxt[lst[pa[y]]] = y;
			lst[pa[y]] = y;
			pq.push(make_pair(a[pa[y]] + x, pa[y]));
			a[pa[y]] = a[pa[y]] + x;
		}
	}
	
	return 0;
}