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.*;
  import java.util.*;
  
  public class Main {
      private static class Node {
          private int val;
          private Node next;
          private Node(int val) {
              this.val = val;
              this.next = null;
          }
      }
      private static class LinkedList {
          private Node head;
          private Node tail;
          private LinkedList() {
              head = new Node(-1);
              tail = head;
          }
          private void append(int val) {
              tail.next = new Node(val);
              tail = tail.next;
          }
          private void append(LinkedList o) {
              if(o.head.next == null) {
                  return;
              }
              tail.next = o.head.next;
              tail = o.tail;
          }
      }
      public static void main(String[] args) throws IOException{
          //BufferedReader f = new BufferedReader(new FileReader("uva.in"));
          BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
          //PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("cowjump.out")));
          PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
          LinkedList[] indexes = new LinkedList[500001];
          for(int i = 0; i <= 500000; i++) {
              indexes[i] = new LinkedList();
          }
          int q = Integer.parseInt(f.readLine());
          int idx = 0;
          while(q-- > 0) {
              StringTokenizer st = new StringTokenizer(f.readLine());
              int t = Integer.parseInt(st.nextToken());
              int x = Integer.parseInt(st.nextToken());
              if(t == 1) {
                  indexes[x].append(idx++);
              } else {
                  int y = Integer.parseInt(st.nextToken());
                  if(x == y) {
                      continue;
                  }
                  indexes[y].append(indexes[x]);
                  indexes[x] = new LinkedList();
              }
          }
          int[] res = new int[idx];
          for(int i = 0; i <= 500000; i++) {
              Node temp = indexes[i].head;
              while(temp.next != null) {
                  res[temp.next.val] = i;
                  temp = temp.next;
              }
          }
          out.print(res[0]);
          for(int i = 1; i < idx; i++) {
              out.print(" " + res[i]);
          }
          out.println();
          f.close();
          out.close();
      }
  }
  