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 CF1620E extends PrintWriter {
	CF1620E() { super(System.out); }
	Scanner sc = new Scanner(System.in);
	public static void main(String[] $) {
		CF1620E o = new CF1620E(); o.main(); o.flush();
	}

	static final int X = 500000;
	void main() {
		int q = sc.nextInt();
		int[] tt = new int[q];
		int[] xx = new int[q];
		int[] yy = new int[q];
		int n = 0;
		for (int h = 0; h < q; h++) {
			tt[h] = sc.nextInt();
			xx[h] = sc.nextInt();
			if (tt[h] == 1)
				n++;
			else
				yy[h] = sc.nextInt();
		}
		int[] zz = new int[X + 1];
		for (int x = 1; x <= X; x++)
			zz[x] = x;
		int[] qu = new int[n]; int cnt = n;
		for (int h = q - 1; h >= 0; h--)
			if (tt[h] == 1)
				qu[--cnt] = zz[xx[h]];
			else
				zz[xx[h]] = zz[yy[h]];
		for (int i = 0; i < n; i++)
			print(qu[i] + " ");
		println();
	}
}
