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 sys
  tokens = ''.join(sys.stdin.readlines()).split()[::-1]
  
  def next(): return tokens.pop()
  def nextInt(): return int(next())
  def nextFloat(): return float(next())
  def getIntArray(n): return [nextInt() for _ in range(n)]
  def getFloatArray(n): return [nextFloat() for _ in range(n)]
  def getStringArray(n): return [next() for _ in range(n)]
  
  l = 0
  map = {}
  
  testcase = True
  def solve(testcase = 1):
      global l
      if nextInt() == 1:
          ele = nextInt()
          if ele not in map: map[ele] = []
          map[ele].append(l)
          l += 1
      else:
          find, replace = nextInt(), nextInt()
          if find not in map or find == replace: return
          elif replace not in map: map[replace] = []
          a, b = (map[find], map[replace]) if len(map[find]) > len(map[replace]) else (map[replace], map[find])
          a += b
          map[replace] = a
          del map[find]
  
  
  if testcase is None:
      testcaseCount = 1
      while tokens:
          solve(testcaseCount)
          testcaseCount += 1
  else:
      testcaseCount = nextInt() if testcase else 1
      for tc in range(testcaseCount):
          solve(tc + 1)
      assert not tokens
  
  ans = [None for i in range(l)]
  for value in map:
      for idx in map[value]:
          ans[idx] = value
  print(*ans)