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.*;
public class ReplaceTheNums{
    public static void main(String args[]){
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        try{
            int q = Integer.parseInt(br.readLine());
            int t = q;
            int arr[] = new int[q];
            int qr[] = new int[q];
            int x[] = new int[q];
            int y[] = new int[q];
            int val[] = new int[500001];
            while(t-->0){
                String s = br.readLine();
                String str[] = s.split(" ");
                qr[t] = Integer.parseInt(str[0]);
                x[t] = Integer.parseInt(str[1]);
                if(qr[t]==2) 
                    y[t] = Integer.parseInt(str[2]);
            }
            for(int i=0; i<=500000 ; i++)
                val[i] = i;
            int k=0;
            for(int i=0 ; i<q ; i++){
                if(qr[i]==1)
                    arr[k++] = val[x[i]];
                else
                    val[x[i]] = val[y[i]];
            }
            while(k-->0)
                System.out.print(arr[k]+" ");
                
        }catch(Exception e){
            e.printStackTrace();
        }
    }
}