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.*;
  import java.lang.*;
  import java.io.*;
  
  public class Main {
      public static long mod = 1000000007;
      public static long mod2 = 998244353;
  
      public static void main(String[] args) throws java.lang.Exception {
          Reader sc = new Reader();
          FastNum in = new FastNum(System.in);
          PrintWriter out = new PrintWriter(System.out);
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  
          HashMap<Integer, LinkedList> map = new HashMap<>();
          int tests = in.nextInt();
          int pos = 0;
          for (int test = 1; test <= tests; test++) {
              int q = in.nextInt();
              if(q == 1) {
                  int x = in.nextInt();
                  if(map.containsKey(x)) {
                      LinkedList list = map.get(x);
                      list.add(pos);
                      pos++;
                      map.put(x, list);
                  } else {
                      LinkedList list = new LinkedList();
                      list.add(pos);
                      pos++;
                      map.put(x, list);
                  }
              } else {
                  int x = in.nextInt();
                  int y = in.nextInt();
                  if(x == y) continue;
                  if(map.containsKey(x)) {
                      if(map.containsKey(y)) {
                          LinkedList list1 = map.get(x);
                          LinkedList list2 = map.get(y);
                          list2.merge(list1);
                          map.put(y, list2);
                          map.remove(x);
                      } else map.put(y, map.remove(x));
                  }
              }
          }
          int[] ans = new int[pos];
          Set<Integer> s = map.keySet();
          for(int i : s) {
              LinkedList list = map.get(i);
              ListNode node = list.head;
              while (node != null) {
                  ans[node.val] = i;
                  node = node.next;
              }
          }
  
          for(int i : ans) {
              out.print(i + " ");
          }
  
  
          out.flush();
      }
  
      public static class ListNode {
          int val;
          ListNode next;
          ListNode(int x) {
              val = x;
          }
      }
  
      public static class LinkedList {
          ListNode head;
          ListNode tail;
          int size;
          public LinkedList() {
              head = null;
              tail = null;
              size = 0;
          }
          public void add(int x) {
              ListNode node = new ListNode(x);
              if(head == null) {
                  head = node;
                  tail = node;
              } else {
                  tail.next = node;
                  tail = node;
              }
              size++;
          }
          public void merge(LinkedList list) {
              if(list.head == null) return;
              if(head == null) {
                  head = list.head;
                  tail = list.tail;
                  size = list.size;
                  return;
              }
              tail.next = list.head;
              tail = list.tail;
              size += list.size;
          }
      }
  
  
  
      public static int gcd(int a, int b) {
          if (a == 0)
              return b;
          return gcd(b % a, a);
      }
  
      public static long power(long a, long b) {
          if (b == 0)
              return 1;
          long answer = power(a, b / 2) % mod;
          answer = (answer * answer) % mod;
          if (b % 2 != 0)
              answer = (answer * a) % mod;
          return answer;
      }
  
      public static void swap(int x, int y) {
          int t = x;
          x = y;
          y = t;
      }
  
      public static long min(long a, long b) {
          if (a < b) return a;
          return b;
      }
  
      public static long divide(long a, long b) {
          return (a % mod * (power(b, mod - 2) % mod)) % mod;
      }
  
      public static long nCr(long n, long r) {
          long answer = 1;
          long k = min(r, n - r);
          for (long i = 0; i < k; i++) {
              answer = (answer % mod * (n - i) % mod) % mod;
              answer = divide(answer, i + 1);
          }
          return answer % mod;
      }
  
      public static boolean plaindrome(String str) {
          StringBuilder sb = new StringBuilder();
          sb.append(str);
          return (str.equals((sb.reverse()).toString()));
      }
  
      public static class Pair {
          int a;
          int b;
  
          Pair(int s, int e) {
              a = s;
              b = e;
          }
      }
  
      static class Assert {
          static void check(boolean e) {
              if (!e) {
                  throw new AssertionError();
              }
          }
      }
  
      static class FastNum implements AutoCloseable {
  
          InputStream is;
          byte buffer[] = new byte[1 << 16];
          int size = 0;
          int pos = 0;
  
          FastNum(InputStream is) {
              this.is = is;
          }
  
          int nextChar() {
              if (pos >= size) {
                  try {
                      size = is.read(buffer);
                  } catch (IOException e) {
                      throw new IOError(e);
                  }
                  pos = 0;
                  if (size == -1) {
                      return -1;
                  }
              }
              Assert.check(pos < size);
              int c = buffer[pos] & 0xFF;
              pos++;
              return c;
          }
  
          int nextInt() {
              int c = nextChar();
              while (c == ' ' || c == '\r' || c == '\n' || c == '\t') {
                  c = nextChar();
              }
              if (c == '-') {
                  c = nextChar();
                  Assert.check('0' <= c && c <= '9');
                  int n = -(c - '0');
                  c = nextChar();
                  while ('0' <= c && c <= '9') {
                      int d = c - '0';
                      c = nextChar();
                      Assert.check(n > Integer.MIN_VALUE / 10
                              || n == Integer.MIN_VALUE / 10 && d <= -(Integer.MIN_VALUE % 10));
                      n = n * 10 - d;
                  }
                  return n;
              } else {
                  Assert.check('0' <= c && c <= '9');
                  int n = c - '0';
                  c = nextChar();
                  while ('0' <= c && c <= '9') {
                      int d = c - '0';
                      c = nextChar();
                      Assert.check(
                              n < Integer.MAX_VALUE / 10 || n == Integer.MAX_VALUE / 10 && d <= Integer.MAX_VALUE % 10);
                      n = n * 10 + d;
                  }
                  return n;
              }
          }
  
          @Override
          public void close() {
          }
      }
  
  
      static class Reader {
          final private int BUFFER_SIZE = 1 << 16;
          private final DataInputStream din;
          private final byte[] buffer;
          private int bufferPointer, bytesRead;
  
          public Reader() {
              din = new DataInputStream(System.in);
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public Reader(String file_name) throws IOException {
              din = new DataInputStream(new FileInputStream(file_name));
              buffer = new byte[BUFFER_SIZE];
              bufferPointer = bytesRead = 0;
          }
  
          public String readLine() throws IOException {
              byte[] buf = new byte[64]; // line length
              int cnt = 0, c;
              while ((c = read()) != -1) {
                  if (c == '\n')
                      break;
                  buf[cnt++] = (byte) c;
              }
              return new String(buf, 0, cnt);
          }
  
          public int nextInt() throws IOException {
              int ret = 0;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              } while ((c = read()) >= '0' && c <= '9');
  
              if (neg)
                  return -ret;
              return ret;
          }
  
          public long nextLong() throws IOException {
              long ret = 0;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
              if (neg)
                  return -ret;
              return ret;
          }
  
          public double nextDouble() throws IOException {
              double ret = 0, div = 1;
              byte c = read();
              while (c <= ' ')
                  c = read();
              boolean neg = (c == '-');
              if (neg)
                  c = read();
  
              do {
                  ret = ret * 10 + c - '0';
              }
              while ((c = read()) >= '0' && c <= '9');
  
              if (c == '.') {
                  while ((c = read()) >= '0' && c <= '9') {
                      ret += (c - '0') / (div *= 10);
                  }
              }
  
              if (neg)
                  return -ret;
              return ret;
          }
  
          private void fillBuffer() throws IOException {
              bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
              if (bytesRead == -1)
                  buffer[0] = -1;
          }
  
          private byte read() throws IOException {
              if (bufferPointer == bytesRead)
                  fillBuffer();
              return buffer[bufferPointer++];
          }
  
          public void close() throws IOException {
              if (din == null)
                  return;
              din.close();
          }
      }
  }
  