//Δ_D
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef double DB;
const int N = 111111;
const int B = 1e6;
int n,b[N],f[N],l[N],r[N],nx[N],e[N];
DB t[N],p[N],a[N];
priority_queue<pair<DB,int> > Q;
int fnd(int x){
	if(f[x]==x)
		return x;
	return f[x]=fnd(f[x]);
}
void mrg(int x,int y){//cout<<x<<' '<<y<<endl;
	x=fnd(x);
	y=fnd(y);
	nx[r[x]]=l[y];
	r[x]=r[y];
	t[x]+=t[y];
	p[x]*=p[y];
	a[x]=t[x]/(1-p[x]);
	if(x)
		Q.push(make_pair(-a[x],x));
	f[y]=x;
}
int main(){
	int i,j,x;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%lf%lf%d",t+i,p+i,b+i);
		a[i]=t[i]/(1-p[i]);
	}
	for(i=0;i<=n;i++)
		f[i]=i,l[i]=i,r[i]=i,nx[i]=-1,e[i]=0;
	for(i=1;i<=n;i++)
		Q.push(make_pair(-a[i],i));
	while(!Q.empty()){
		i=Q.top().second;
		Q.pop();
		if(e[i])
			continue;
		e[i]=1;
		mrg(b[i],i);
	}
	for(i=nx[0];i>=0;i=nx[i])
		printf("%d\n",i);
	return 0;
}