description: 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].
solution: import java.util.ArrayList;
  import java.util.Collections;
  import java.util.Scanner;
  
  public class Test3 {
  	public static void main(String[] args) throws Exception {
  		final Scanner cin = new Scanner(System.in);
  		final StringBuilder cout = new StringBuilder();
  
  		int t = cin.nextInt();
  		int[][] queries = new int[t][3];
  		int[] getVal = new int[(int) (5 * 10e5) + 1];
  		for (int ii = 0; ii < t; ii++) {
  			queries[ii][0] = cin.nextInt();
  			queries[ii][1] = cin.nextInt();
  			if (queries[ii][0] == 2)
  				queries[ii][2] = cin.nextInt();
  		}
  		for (int i = 0; i < getVal.length; i++) {
  			getVal[i] = i;
  		}
  		ArrayList<Integer> ans = new ArrayList<>();
  		for (int i = t - 1; i >= 0; i--) {
  			if (queries[i][0] == 2) {
  				getVal[queries[i][1]] = getVal[queries[i][2]];
  			} else {
  				ans.add(getVal[queries[i][1]]);
  			}
  		}
  		Collections.reverse(ans);
  		for (int no : ans)
  			cout.append(no).append(' ');
  		System.out.println(cout);
  	}
  
  }