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 new1{

	
	
	
	public static void main(String[] args)  throws IOException{
    	BufferedWriter output = new BufferedWriter(new OutputStreamWriter(System.out));
		FastReader s = new FastReader();
		int t = 1;//s.nextInt();
    	for(int z = 0; z < t; z++) {
    		int n = s.nextInt();
    		ArrayList<Integer> aList = new ArrayList<Integer>();
    		ArrayList<int[]> quer = new ArrayList<int[]>();
    		for(int i = 0; i < n; i++) {
    			int ty = s.nextInt();
    			if(ty == 1) {
    				int[] aa = {1, s.nextInt()};
    				quer.add(aa);
    			}
    			else {
    				int a1 = s.nextInt(); int a2 = s.nextInt();
    				int[] aa = {2, a1, a2, a2};
    				quer.add(aa);
    			}
    		}
    		int[] ind = new int[500005];
    		Arrays.fill(ind, -1);
    		for(int i = quer.size() - 1; i >= 0; i--) {
    			int[] aa = quer.get(i);
    			if(aa[0] == 2) {
    				int in = ind[aa[2]];
    				if(in != -1) aa[3] = quer.get(in)[3];
    				ind[aa[1]] = i;
    			}
    			else {
    				int in = ind[aa[1]];
    				if(in == -1) aList.add(aa[1]);
    				else aList.add(quer.get(in)[3]);
    			}
    		}
    		
    		for(int i = aList.size() - 1; i >= 0; i--) {
    			output.write((aList.get(i) + " "));
    		}
    		output.write("\n");
    	}
    	output.flush();

    }
}


class FastReader {
    BufferedReader br;
    StringTokenizer st;
    public FastReader() {
        br = new BufferedReader(new InputStreamReader(System.in));
    }
    String next() {
        while (st == null || !st.hasMoreElements()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        return st.nextToken();
    }
 
    public int nextInt() {
        return Integer.parseInt(next());
    }
 
    long nextLong() {
        return Long.parseLong(next());
    }
 
    double nextDouble() {
        return Double.parseDouble(next());
    }
 
    String nextLine() {
        String str = "";
        try {
            str = br.readLine();
        } catch (IOException e) {
            e.printStackTrace();
        }
        return str;
}}