#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define Mp make_pair
#define pb push_back
#define SZ(a) (int(a.size()))

typedef long long ll;
typedef double db;
typedef std::pair<int, int> pii;
typedef std::vector<int> vi;
#define log(...) fprintf(stderr, __VA_ARGS__)
std::mt19937_64 gen(std::chrono::system_clock::now().time_since_epoch().count());
ll get(ll l, ll r) { std::uniform_int_distribution<ll> dist(l, r); return dist(gen); }

constexpr int N = 100100;

int n, f[N], g[N], ged[N], fa[N], v[N]; db c[N], p[N];
struct node {
	db c, p; int id;
	node(db c_=0, db p_=0, int id_=0) :
		c(c_), p(p_), id(id_) {}
};
bool operator<(const node &a, const node &b) {
	return a.c * (1 - b.p) > b.c * (1 - a.p);
}
int find(int x) { return x == f[x] ? x : f[x] = find(f[x]); }
signed main() {
	atexit([](){cerr << "time: " << (db)clock()/CLOCKS_PER_SEC << "s\n";});
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	cin >> n;
	priority_queue<node> q;
	for(int i = 1; i <= n; i++) {
		cin >> c[i] >> p[i] >> fa[i];
		q.emplace(c[i], p[i], i);
		f[i] = i, ged[i] = i;
	}
	v[0] = 1;
	vi ans;
	while(SZ(q)) {
		auto [ci, pi, id] = q.top(); q.pop();
		if(c[id] != ci || p[id] != pi) continue;
		int fz = find(fa[id]);
		if(v[fz]) {
			for(int x = id; x; x = g[x])
				ans.pb(x);
			v[id] = 1;
		} else {
			c[fz] = c[fz] + c[id] * p[fz];
			p[fz] = p[fz] * p[id];
			f[id] = fz;
			g[ged[fz]] = id;
			ged[fz] = ged[id];
			q.emplace(c[fz], p[fz], fz);
		}
	}
	for(int i : ans) cout << i << '\n';
	return 0;
}