using System;

using System.Collections.Generic;

​

class Program

{

    static int[] parent;

    static int[] a;

​

    // Find function with path compression

    static int Find(int i)

    {

        if (parent[i] != i)

        {

            parent[i] = Find(parent[i]); // Path compression

        }

        return parent[i];

    }

​

    // Union function to make i child of pi

    static void Union(int i, int pi)

    {

        parent[i] = Find(pi); // Make i a child of pi

    }

​

    // Solve function to process all inputs

    static void Solve()

    {

        int n = int.Parse(Console.ReadLine());

        parent = new int[n + 1]; // Parent array

        a = new int[n + 1]; // Array for a_i values

​

        for (int i = 0; i <= n; i++)

        {

            parent[i] = i; // Initialize each node as its own parent

        }

​

        // Read and process the n operations

        for (int i = 1; i <= n; i++)

        {

            string[] input = Console.ReadLine().Split();

            int t = int.Parse(input[0]);

            int pi = int.Parse(input[1]);

            int ai = int.Parse(input[2]);

            a[i] = ai;

​

            if (t == 1)

            {

                // Simple union, make i child of pi

                Union(i, pi);

            }

            else if (t == 2)

            {

                // Special union with a_i condition

                while (a[Find(pi)] < a[i])

                {

                    pi = parent[pi];

                }

                Union(i, pi);

            }

        }

​

        // Output the final parent for each node

        for (int i = 1; i <= n; i++)

        {

            Console.WriteLine(Find(i));

        }

    }

​

    static void Main(string[] args)

    {

        Solve();

    }

}

​