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.*;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;
import java.util.StringTokenizer;

public class Main {
    
    public static void main(String[] args) {
    
        var sc = new FastScanner(System.in);
        var pw = new PrintWriter(System.out);
        
        var map = new HashMap<Integer, ArrayList<Integer>>();
        
        int q = Integer.parseInt(sc.next());
        int index = 0;
        for(int i = 0; i < q; i++){
            int a = Integer.parseInt(sc.next());
            if(a == 1){
                int x = Integer.parseInt(sc.next());
                if(!map.containsKey(x)){
                    map.put(x, new ArrayList<>());
                }
                map.get(x).add(index++);
            }else{
                int x = Integer.parseInt(sc.next());
                int y = Integer.parseInt(sc.next());
                if(x == y) continue;
                if(!map.containsKey(x)){
                    map.put(x, new ArrayList<>());
                }
                if(!map.containsKey(y)){
                    map.put(y, new ArrayList<>());
                }
                if(map.get(x).size() < map.get(y).size()){
                    for (Integer value : map.get(x)) {
                        map.get(y).add(value);
                    }
                }else{
                    for (Integer value : map.get(y)) {
                        map.get(x).add(value);
                    }
                    map.put(y, map.get(x));
                }
                map.put(x, new ArrayList<>());
            }
        }
        
        var ans = new int[index];
        for (Integer key : map.keySet()) {
            for (Integer value : map.get(key)) {
                ans[value] = key;
            }
        }
        for(int i = 0; i < index; i++){
            if(i < index-1){
                pw.print(ans[i] + " ");
            }else{
                pw.println(ans[i]);
            }
        }
        pw.flush();
    }
    
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;
        
        public FastScanner(InputStream in) {
            br = new BufferedReader(new InputStreamReader(in));
        }
        String next(){
            while(st == null || !st.hasMoreTokens()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch(IOException e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
    }
}