You have an array of integers (initially empty).

You have to perform q queries. Each query is of one of two types: 

  * "1 x" — add the element x to the end of the array; 
  * "2 x y" — replace all occurrences of x in the array with y. 



Find the resulting array after performing all the queries.

Input

The first line contains a single integer q (1 ≤ q ≤ 5 ⋅ 10^5) — the number of queries.

Next q lines contain queries (one per line). Each query is of one of two types: 

  * "1 x" (1 ≤ x ≤ 5 ⋅ 10^5); 
  * "2 x y" (1 ≤ x, y ≤ 5 ⋅ 10^5). 



It's guaranteed that there is at least one query of the first type.

Output

In a single line, print k integers — the resulting array after performing all the queries, where k is the number of queries of the first type.

Examples

Input


7
1 3
1 1
2 1 2
1 2
1 1
1 2
2 1 3


Output


3 2 2 3 2 

Input


4
1 1
1 2
1 1
2 2 2


Output


1 2 1 

Input


8
2 1 4
1 1
1 4
1 2
2 2 4
2 4 3
1 2
2 2 7


Output


1 3 3 7 

Note

In the first example, the array changes as follows:

[] → [3] → [3, 1] → [3, 2] → [3, 2, 2] → [3, 2, 2, 1] → [3, 2, 2, 1, 2] → [3, 2, 2, 3, 2].

In the second example, the array changes as follows:

[] → [1] → [1, 2] → [1, 2, 1] → [1, 2, 1].

In the third example, the array changes as follows:

[] → [] → [1] → [1, 4] → [1, 4, 2] → [1, 4, 4] → [1, 3, 3] → [1, 3, 3, 2] → [1, 3, 3, 7].
1
1 50
 1
1 114514
 1
1 2002
 1
1 500

50 
 114514 
 2002 
 500 


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class E {
    static class RealScanner {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next() {
            while (!st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        int[] readArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

        long nextLong() {
            return Long.parseLong(next());
        }
    }

    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        RealScanner sc = new RealScanner();
        List<Integer> l = new ArrayList<>();
        int q = sc.nextInt();
        int id = 500000 + 1;
//        List<Integer> idx = new ArrayList<>();
        int count = 0;
        int[] arr[] = new int[id][2];
        int[] st_arr = new int[id];
//        int[] def_arr = new int[id];
        int[] res = new int[id];
        for (int i = 1; i < id; i++) {
            st_arr[i] = i;
        }
        for (int i = 0; i < q; i++) {
            int n = sc.nextInt();
            if (n == 1) {
                int a = sc.nextInt();
                arr[i][0] = -1;
                arr[i][1] = a;
                count++;
            } else {
                int a, b;
                a = sc.nextInt();
                b = sc.nextInt();
                arr[i][0] = a;
                arr[i][1] = b;
            }
        }
        int val = count, temp;
        for (int i = q - 1; i >= 0; i--) {
            int x, y;
            x = arr[i][0];
            y = arr[i][1];
            if (arr[i][0] != -1) {
                st_arr[x] = y;
            } else {
                temp = st_arr[y];
                res[count] = temp;
                count--;
            }
        }
        for (int i = 1; i <= val; i++) {
            out.print(res[i] + " ");
        }
        out.println();
        out.flush();
        out.close();
    }
}
