#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

int N;
int A[10001], Y[10001], Yt[10001], C[10000];
int main()
{
    ifstream fin("famtree.in");
    fin >> N;
    for (int i = 0; i < N - 1; i++)
    {
        int a, b, y;
        fin >> a >> b >> y;
        A[a] = b;
        Y[a] = y;
    }

    for (int i = 1; i <= N; i++)
    {
        int j = i, yt = 0;

        while (A[j])
        {
            yt += Y[j];
            j = A[j];
        }
        Yt[i] = yt;
    }

    int max_mil = 0;
    for (int i = 1; i <= N; i++)
    {
        int mil = Yt[i] / 1000;
        C[mil]++;
        if (max_mil < mil)
            max_mil = mil;
    }

    ofstream fout("famtree.out");
    bool n = false;
    for (int i = 1; i < max_mil; i++)
    {
        if (C[i] > C[i - 1] && C[i] > C[i + 1])
        {
            if (n)
                fout << ' ';
            n = true;
            fout << i;
        }
    }
    return 0;
}