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.io.PrintWriter;
  import java.util.ArrayList;
  import java.util.Scanner;
  
  public class Main {
      
      public static void main(String[] args) {
          
          var sc = new Scanner(System.in);
          var pw = new PrintWriter(System.out);
          
          int q = Integer.parseInt(sc.next());
          var a = new int[q];
          var x = new int[q];
          var y = new int[q];
          for(int i = 0; i < q; i++){
              a[i] = Integer.parseInt(sc.next());
              if(a[i] == 1){
                  x[i] = Integer.parseInt(sc.next());
              }else{
                  x[i] = Integer.parseInt(sc.next());
                  y[i] = Integer.parseInt(sc.next());
              }
          }
          
          var ans = new ArrayList<Integer>();
          var b = new int[500001];
          for(int i = 0; i <= 500000; i++){
              b[i] = i;
          }
          for(int i = q-1; i >= 0; i--){
              if(a[i] == 1){
                  ans.add(b[x[i]]);
              }else{
                  b[x[i]] = b[y[i]];
              }
          }
          for(int i = ans.size()-1; i >= 0; i--){
              if(i > 0){
                  pw.print(ans.get(i) + " ");
              }else{
                  pw.println(ans.get(i));
              }
          }
          pw.flush();
      }
  }