#include <bits/stdc++.h>
using namespace std;
#define int long long
struct DisjointSet{
	vector<int>parent,sz;
	int size;
	void init(int n){
		size = n;
		parent.resize(n+1); sz.resize(n+1);
		for(int i = 1; i<=n; i++){
			parent[i] = i;
			sz[i] = 1;
		}
	}
	int find(int x){
		if(parent[x]==x)return x;
		return parent[x]=find(parent[x]);
	}
	void Union(int x, int y){
		x = find(x); y = find(y);
		if(x==y)return;
			parent[x] = y;
			sz[y]+=sz[x];
	}
};
const int mxn = 100005;
vector<vector<int>>adj(mxn);
vector<int>parent(mxn);
vector<vector<pair<int,int>>>g(mxn);
struct node{
	double a;
	double b;
	double e;
};
bool operator <(node a, node b){
	return a.e*a.b + (1-a.b)*b.b*(b.e+a.a) < b.e*b.b + (1-b.b)*a.b*(a.e+b.a);
}
bool operator ==(node a, node b){
	
	return a.e*a.b + (1-a.b)*b.b*(b.e+a.a) == b.e*b.b + (1-b.b)*a.b*(a.e+b.a);
}
node merge(node a, node b){
	double p = 1-(1-a.b)*(1-b.b);
	return node{a.a+b.a, 1-(1-a.b)*(1-b.b),  1/p*a.e*a.b + 1/p*(1-a.b)*b.b*(b.e+a.a) };
}
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n;
	cin >> n;
	set<pair<node,int>>s;
	vector<node>val(n+1);
	for(int i = 1; i<=n; i++){
		double u, d;
		cin >> u >> d >> parent[i];
		d = 1-d;
		val[i] = node{u,d,u};
	}
	for(int i = 1; i<=n; i++){
		s.insert({val[i],i});
	}
	DisjointSet ds;
	ds.init(n+1);
	for(int i = 1; i<=n; i++){
		auto [res, u] = *s.begin();
		s.erase(s.begin());
		int p = ds.find(parent[u]);
		if(p!=0){
			s.erase({val[p],p});
		}
		val[p] = merge(val[p],res);
		if(p!=0){
			s.insert({val[p],p});
		}
		ds.Union(u,p);
		g[parent[u]].push_back({i,u});
	}
	priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
	pq.push({0,0});
	while(pq.size()){
		auto [_, cur] = pq.top(); pq.pop();
		if(cur!=0)cout << cur << '\n';
		for(auto nxt: g[cur]){
			pq.push(nxt);
		}
	}
	return 0;
}