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

public class A {
    public static void getAns(int[] ans, int idx, ArrayList<Integer> vals, ArrayList<Integer> al) {
        if (ans[idx] != -1) {
            return;
        }
        if (al.get(idx) == idx) {
            ans[idx] = vals.get(idx);
        } else {
            getAns(ans, al.get(idx), vals, al);
            ans[idx] = ans[al.get(idx)];
        }
    }

    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);
        PrintWriter pw = new PrintWriter(System.out);
        int q = sc.nextInt();
        ArrayList<Integer> al = new ArrayList<>();
        ArrayList<Integer> vals = new ArrayList<>();
        int cur = 0;
        HashMap<Integer, Integer> par = new HashMap<>();
        while (q-- > 0) {
            int op = sc.nextInt();
            if (op == 1) {
                int x = sc.nextInt();
                al.add(cur);
                vals.add(x);
                if (par.containsKey(x)) {
                    int oldPar = par.get(x);
                    al.set(oldPar, cur);
                }
                par.put(x, cur);
                cur++;
            } else {
                int x = sc.nextInt();
                int y = sc.nextInt();
                if (!par.containsKey(x))
                    continue;
                if (par.containsKey(y)) {
                    al.set(par.get(x), par.get(y));
                    par.remove(x);
                } else {
                    par.put(y, par.get(x));
                    vals.set(par.get(x), y);
                    par.remove(x);
                }
            }
//            pw.println(vals);
//            pw.println(par);
//            pw.println(al);
//            pw.println("AAAAAAAAA");
        }
        int[] ans = new int[vals.size()];
        Arrays.fill(ans, -1);
        for (int i = 0; i < ans.length; i++) {
            getAns(ans, i, vals, al);
        }
        for (int x : ans) {
            pw.print(x + " ");
        }
        pw.println();
        pw.close();
    }

    static class Scanner {
        BufferedReader br;
        StringTokenizer st;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() throws IOException {
            while (st == null || !st.hasMoreTokens())
                st = new StringTokenizer(br.readLine());
            return st.nextToken();
        }

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

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

        public double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        public int[] nextIntArr(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = Integer.parseInt(next());
            }
            return arr;
        }
    }
}