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
  input = sys.stdin.readline
  mod = 998244353
  
  
  def power(num, ex):
      pw, res = num, 1
      while ex:
          if ex & 1:
              res = res * pw
          pw = pw * pw
          ex >>= 1
      return res
  
  
  def power_with_modulo(num, ex):
      pw, res = num % mod, 1
      while ex:
          if ex & 1:
              res = res * pw % mod
          pw = pw * pw % mod
          ex >>= 1
      return res
  
  
  q = int(input())
  ans = []
  mp = {}
  queries = []
  while q:
      a = list(map(int, input().split()))
      queries.append(a)
      q -= 1
  
  queries.reverse()
  for a in queries:
      if a[0] == 1:
          x = a[1]
          if x in mp.keys():
              ans.append(mp[x])
          else:
              ans.append(x)
      else:
          x, y = a[1], a[2]
          if y in mp.keys():
              mp[x] = mp[y]
          else:
              mp[x] = y
      q -= 1
  
  print(*ans[::-1])
  
  
  
  
  
  
  