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: # -----------------FAST IO-------------------------
  import os
  import sys
  from io import BytesIO, IOBase
  
  BUFSIZE = 8192
  
  
  class FastIO(IOBase):
      newlines = 0
  
      def __init__(self, file):
          self._fd = file.fileno()
          self.buffer = BytesIO()
          self.writable = "x" in file.mode or "r" not in file.mode
          self.write = self.buffer.write if self.writable else None
  
      def read(self):
          while True:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              if not b:
                  break
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines = 0
          return self.buffer.read()
  
      def readline(self):
          while self.newlines == 0:
              b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
              self.newlines = b.count(b"\n") + (not b)
              ptr = self.buffer.tell()
              self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
          self.newlines -= 1
          return self.buffer.readline()
  
      def flush(self):
          if self.writable:
              os.write(self._fd, self.buffer.getvalue())
              self.buffer.truncate(0), self.buffer.seek(0)
  
  
  class IOWrapper(IOBase):
      def __init__(self, file):
          self.buffer = FastIO(file)
          self.flush = self.buffer.flush
          self.writable = self.buffer.writable
          self.write = lambda s: self.buffer.write(s.encode("ascii"))
          self.read = lambda: self.buffer.read().decode("ascii")
          self.readline = lambda: self.buffer.readline().decode("ascii")
  
  
  # sys.stdin = open('input.txt', 'r')
  # sys.stdout = open('output.txt', 'w')
  # sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  # input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  #---------------------------------------------------
  
  import math
  import collections
  from itertools import permutations
  from itertools import combinations
  
  
  '''def is_prime(n):
      j=2
      while j*j<=n:
          if n%j==0:
              return 0
          j+=1
      return 1'''
  
  
  '''def gcd(x, y):
      while(y):
          x, y = y, x % y
      return x'''
  
  '''fact=[]
  def factors(n) :
       
      i = 1
      while i <= math.sqrt(n):
           
          if (n % i == 0) :
               
              if (n / i == i) :
                  fact.append(i)
  
              else :
      
                  fact.append(i)
                  fact.append(n//i)
          i = i + 1'''
  # def LCMofArray(a):
  #   lcm = a[0]
  #   for i in range(1,len(a)):
  #     lcm = lcm*a[i]//math.gcd(lcm, a[i])
  #   return lcm
  def prob():
      
      n = int(input())
      # n,k=[int(x) for x in input().split()]
      # s = input()
      # l = [int(x) for x in input().split()]
      # m = [x for x in input().split()]
  
      qu = []
  
      while n>0:
  
          l = [int(x) for x in input().split()]
          qu.append(l)
          n-=1
  
      di = dict()
  
      qu.reverse()
  
      ans = []
  
      for i in qu:
  
          if i[0] == 1:
              ans.append(di.get(i[1] , i[1]))
          else:
              di[i[1]] = di.get(i[-1] , i[-1])
  
      ans.reverse()
  
      print(*ans)
      
      
  # sys.stdin , sys.stdout = open('input.txt', 'r') , open('output.txt', 'w')
  sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  input = lambda: sys.stdin.readline().rstrip("\r\n")
  
  t=1
  # t=int(input())
  
  for _ in range(0,t):
      # print("Case #" , end="")
      # print(_+1 , end=": ")
      prob()