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

public class TaskE {

    public static void main(String[] arg) {
        final FastScanner in = new FastScanner(System.in);
        final PrintWriter out = new PrintWriter(System.out);
        final int Q = in.nextInt();
        LinkedList<Integer> arr = new LinkedList<>();
        LinkedList<int[]> ops = new LinkedList<>();
        for (int q = 1; q <= Q; q++) {

            int op = in.nextInt();
            if (op == 1) {
                arr.add(in.nextInt());
            } else {
                ops.add(new int[]{arr.size(), in.nextInt(), in.nextInt()});
            }
        }
        StringBuilder res = new StringBuilder();
        List<Integer> sol = solution(arr, ops);
        for (Integer a : sol) {
            res.append(a).append(' ');
        }
        out.println(res);

        out.flush();
        out.close();
        in.close();
    }

    private static List<Integer> solution(LinkedList<Integer> add,
                                          LinkedList<int[]> ops) {
        LinkedList<Integer> result = new LinkedList<>();
        while (!add.isEmpty()) {
            int lastOpPos = -1;
            Map<Integer, Integer> dsu = new HashMap<>();
            if (!ops.isEmpty()) {
                lastOpPos = ops.peek()[0];
            }
            while (lastOpPos <= add.size()&&add.size()>0) {
                int num = add.poll();
                result.addFirst(dsu.getOrDefault(num, num));
            }
            if (!ops.isEmpty()) {
                int[] op = ops.poll();
                if (dsu.containsKey(op[1])) {
                    dsu.put(op[1], op[2]);
                }
            }
        }
        return result;
    }

    public static String arrToString(final int[] a) {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < a.length; i++) {
            sb.append(a[i]).append(' ');
        }
        return sb.toString();
    }

    private static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream stream) {
            try {
                br = new BufferedReader(new InputStreamReader(stream));
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

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

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

        int[] readIntArr(int n) {
            int[] result = new int[n];
            for (int i = 0; i < n; i++) {
                result[i] = Integer.parseInt(next());
            }
            return result;
        }

        long[] readLongArr(int n) {
            long[] result = new long[n];
            for (int i = 0; i < n; i++) {
                result[i] = Long.parseLong(next());
            }
            return result;
        }

        void close() {
            try {
                br.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }

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

    }

}
