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 os
  import sys
  from io import BytesIO, IOBase
  
  from collections import defaultdict, Counter
  
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  import math
  
  def I():
      return(int(input()))
  def lint():
      return(list(map(int,input().split())))
  def insr():
      s = input().strip()
      return(list(s[:len(s)]))
  def invr():
      return(map(int,input().split()))
  # Python program to print all
  # primes smaller than or equal to
  # n using Sieve of Eratosthenes
  
  import heapq
  
  def ask(a,b,c):
      print(f"? {a} {b} {c}")
      sys.stdout.flush()
      res=int(input())
      sys.stdout.flush()
      return res
  t=I()
  l=[]
  for _ in range(t):
      l.append(lint())
  
  d=defaultdict(lambda:None)
  a=defaultdict(lambda:0)
  l=l[::-1]
  ans=[]
  for i in range(t):
      tmp=l[i]
      if tmp[0]==1:
          if d[tmp[1]]!=None:
              ans.append(a[d[tmp[1]]])
              
          else:
              ans.append(tmp[1])
        
      else:
          x,y=tmp[1:]
          if d[y]!=None:
              a[i]=a[d[y]]
          else:
              a[i]=y
          d[x]=i
         
  
  print(*ans[::-1])
          
  
  
          
  
  
      