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.Scanner;
  import java.util.*;
  import java.io.*;
  public class Main
  {
      public static void main(String args[]){
          int q,x,y,c;
          MyScanner scan = new MyScanner();
          out = new PrintWriter(new BufferedOutputStream(System.out));
          q=scan.nextInt();
          int C[]=new int [q];
          int X[]=new int [q];
          int Y[]=new int [q];
          int P[]=new int [500005];
          ArrayList<Integer> res= new ArrayList<Integer>();
          for(int i=0;i<500005;i++){
              P[i]=i;
          }
          
  
          for(int i=0;i<q;i++){
              C[i]=scan.nextInt();
              X[i]=scan.nextInt();
              if(C[i]==1){
                  continue;
              }
              Y[i]=scan.nextInt();
          }
          for(int i=q-1;i>=0;i--){
              if(C[i]==2){
                  P[X[i]]=P[Y[i]];
              }else{
                  res.add(P[X[i]]);
              }
          }
          Collections.reverse(res);
          for(int i=0;i<res.size();i++){
              out.print(res.get(i)+" ");
          }
          out.println();
          out.close();
      }
      public static PrintWriter out;
        
     //-----------MyScanner class for faster input----------
     public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;
   
        public MyScanner() {
           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();
        }
   
        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;
        }
  
     }
  }
  