//Δ_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,t[N],p[N],b[N],a[N],f[N],l[N],r[N],nx[N];
bool cmp(int i,int j){
	return (LL)p[j]*t[i]<(LL)p[i]*t[j];
}
int fnd(int x){
	if(f[x]==x)
		return x;
	return f[x]=fnd(f[x]);
}
void mrg(int x,int y){
	x=fnd(x);
	y=fnd(y);
	nx[r[x]]=l[y];
	r[x]=r[y];
	f[y]=x;
}
int main(){
	int i,x;
	DB d;
	scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d%lf%d",t+i,&d,b+i);
		p[i]=d*B+0.5;
		p[i]=B-p[i];
		a[i]=i;
	}
	sort(a+1,a+n+1,cmp);
	for(i=0;i<=n;i++)
		f[i]=i,l[i]=i,r[i]=i,nx[i]=-1;
	for(i=1;i<=n;i++)
		mrg(b[a[i]],a[i]);
	for(i=nx[0];i>=0;i=nx[i])
		printf("%d\n",i);
	return 0;
}