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.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;

public class replacE {
    static void printArr(String[] a){
        for(int i=0; i<a.length; i++){
            System.out.println(a[i]+" ");
        }
        //System.out.println();
    }
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.valueOf(br.readLine());
        String[] s = new String[n];
        HashMap<Integer, HashSet<Integer>> m = new HashMap<>();
        for(int i=0; i<n; i++){
            s[i]=br.readLine();
        }
        int x=0;
        int y=0;
        int j=0;
        for(int i=0; i<n; i++){
         if(s[i].charAt(0)=='1'){
             x=Integer.valueOf(s[i].split(" ")[1]);
             if(m.containsKey(x)){
                 m.get(x).add(j);
             }else{
                 HashSet<Integer> tmp = new HashSet<>();
                 tmp.add(j);
                 m.put(x,tmp);
             }
             j++;
         }
         else{
             x=Integer.valueOf(s[i].split(" ")[1]);
             y=Integer.valueOf(s[i].split(" ")[2]);
             if(x==y)
                 continue;
             if(m.containsKey(y)&&m.containsKey(x)){
                 m.get(y).addAll(m.remove(x));
             }else if(m.containsKey(x)){
                 m.put(y,m.remove(x));
             }
         }
        }
        System.out.println(m);
        HashMap<Integer, Integer> ans = new HashMap<>(j);
        for(HashMap.Entry<Integer, HashSet<Integer>> a : m.entrySet()){
            Iterator<Integer> it = a.getValue().iterator();
            while(it.hasNext()){
             ans.put(it.next(),a.getKey());
            }
        }
        //System.out.println("l");
        //System.out.println(ans);
        for(int i=0; i<j; i++){
            System.out.print(ans.get(i)+" ");
        }
    }
}
