#include <bits/stdc++.h>

typedef long long ll;
#define int ll

typedef long double ld;
#define double ld

using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

int n;
double c[100500];
double p[100500];
vector<int> g[100500];

struct Node
{
    double c;
    double p;
    int l;
    int r;
};
int m = 0;
Node t[200500];
struct Id
{
    int i;
};
bool operator < (Id x, Id y){ return tuple(t[x.i].p/t[x.i].c, t[x.i].l, t[x.i].r) > tuple(t[y.i].p/t[y.i].c, t[x.i].l, t[x.i].r); }
set<Id> st[200500];

void process(int v, int u)
{
//    cout<<v<<" "<<u<<" "<<st[v].size()<<"\n";
    while (st[v].size() > 0 && !(Id{u} < *st[v].begin()) )
    {
        auto vr = (*st[v].begin()).i;
        st[v].erase(st[v].begin());

        t[m].c = t[u].c + t[vr].c * (1-t[u].p);
        t[m].p = t[u].p + t[vr].p - t[u].p * t[vr].p;
        t[m].l = u;
        t[m].r = vr;
        u = m;
        m++;
    }
    st[v].insert(Id{u});
}

int dfs(int v)
{
//    cout<<v<<endl;
    if (g[v].empty())
    {
        t[m].c = c[v];
        t[m].p = p[v];
        t[m].l = -1;
        t[m].r = v;
        st[v].insert(Id{m});
        m++;

        return v;
    }

    vector<int> vec;
    for (int i : g[v])
        vec.pb(dfs(i));

    pair<int, int> mx = {-1, -1};
    for (int i : vec)
        if (int(g[i].size()) > mx.fi)
        {
            mx.fi = g[i].size();
            mx.se = i;
        }
    int u = mx.se;
    for (int i : vec)
        if (i!=u)
        {
            for (auto id : st[i])
                st[u].insert(id);
        }

    t[m].c = c[v];
    t[m].p = p[v];
    t[m].l = -1;
    t[m].r = v;
    m++;
    process(u, m-1);

//    cout<<v<<" -> ";
//    for (auto id : st[u])
//    {
//        int x = id.i;
//        cout<<t[x].c<<" "<<t[x].p<<" "<<t[x].l<<" "<<t[x].r<<", ";
//    }
//    cout<<"\n";
    return u;
}

vector<int> ans;
void Run(int v)
{
    if (t[v].l == -1)
    {
        ans.pb(t[v].r);
        return;
    }

    Run(t[v].l);
    Run(t[v].r);
}

int used[100500];
int fff[100500];
set<int> todo;
void out(int v)
{
    used[v] = true;
    cout<<v<<"\n";
    for (int j : g[v])
        if (todo.count(j))
    {
        todo.erase(j);
        out(j);
    }
}
main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    cin>>n;
    for (int i=1; i<=n; i++)
    {
        int x;
        cin>>c[i]>>p[i]>>x;
        fff[i] = x;

//        c[i] = rand()%10+1;
//        p[i] = (rand()%10)/20.0+0.25;
//        x = rand()%i;

        p[i] = 1-p[i];
        g[x].pb(i);
    }
    c[0] = 1e18;
    p[0] = 1e-18;

    int r = dfs(0);

    for (auto id : st[r])
        Run(id.i);

//    cout<<st[r].size()<<"\n";

    for (int i : ans)
        if (i > 0)
        {
            if (fff[i] > 0 && used[fff[i]] == 0)
            {
                todo.insert(i);
//                exit(1);
            }
            else
            {
                out(i);
            }
        }

    if (todo.size()>0)
    {
        while (true)
            cout<<":(";
    }
    for (int i=1; i<=n; i++)
        if (used[i] == 0)
            exit(1);
}