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.util.*;
import java.io.*;

public class _1620_E {
    static int MAXQ = 500005;
    static int[] parents;
    public static void main(String[] args) throws IOException {
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out = new PrintWriter(System.out);
        int q = Integer.parseInt(in.readLine());
        parents = new int[MAXQ];

        //stores the value associated with a certain component
        int[] val = new int[MAXQ];

        //stores the component associated with value
        int[] inv = new int[MAXQ];
        Arrays.fill(inv, -1);

        for(int i = 0; i < q; i++) {
            parents[i] = i;
        }
        int p = 0;
        for(int i = 0; i < q; i++) {
            StringTokenizer line = new StringTokenizer(in.readLine());
            int type = Integer.parseInt(line.nextToken());
            int x = Integer.parseInt(line.nextToken());
            if(type == 1) {
                if(inv[x] == -1) {
                    val[p] = x;
                    inv[x] = p;
                }else {
                    parents[p] = inv[x];
                }
                p++;
            }else {
                int y = Integer.parseInt(line.nextToken());
                if(inv[x] == -1) {
                    continue;
                }else {
                    if(inv[y] == -1) {
                        val[inv[x]] = y;
                        inv[y] = inv[x];
                        inv[x] = -1;
                    }else {
                        parents[inv[x]] = inv[y];
                        inv[x] = -1;
                    }
                }
            }
        }
        StringBuilder sb = new StringBuilder();
        for(int i = 0; i < p; i++) {
            sb.append(val[find(i)]);
            sb.append(' ');
        }
        out.println(sb.toString());
        in.close();
        out.close();
    }
    static int find(int node) {
        if(parents[node] == node) {
            return node;
        }
        parents[node] = find(parents[node]);
        return parents[node];
    }
}
