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,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, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
  try:sys.stdin,sys.stdout=open('in.txt','r'),open('out.txt','w')
  except:pass
  ii1=lambda:int(sys.stdin.readline().strip()) # for interger
  is1=lambda:sys.stdin.readline().strip() # for str
  iia=lambda:list(map(int,sys.stdin.readline().strip().split())) # for List[int]
  isa=lambda:sys.stdin.readline().strip().split() # for List[str]
  mod=int(1e9 + 7);
  from math import inf 
  from collections import defaultdict as dd
  # from math import *
  # from collections import *;
  # from collections import deque as dq 
  # from string import ascii_lowercase,ascii_uppercase
  # from functools import lru_cache
  # sys.setrecursionlimit(500000)
  # from bisect import bisect_left as bl,bisect_right as br
  # from heapq import heapify,heappop,heappush
  # def google(p):print('Case #'+str(p)+': ',end='')
  ###################### Start Here ######################
  def main(t):
      idx = 0 
      dic = dd(list)
      for _ in range(ii1()):
          arr = iia()
          if arr[0] == 1:
              x = arr[1]
              dic[x].append(idx)
              idx += 1 
          else:
              x = arr[1]
              y = arr[2]
              if x in dic and x!=y:
                  n1 = len(dic[x])
                  n2 = len(dic[y])
                  if n1>n2:
                      curr = dic[y]
                      dic[y] = dic[x]
                      dic[y].extend(curr)
                      del dic[x]
                  else:
                      dic[y].extend(dic.pop(x))
          # print(dic)
      ans = [None]*idx 
      for key in dic:
          for i in dic[key]:
              ans[i] = key 
      print(*ans)
      
       
  
  
  
  if __name__ == "__main__":
      t = 1 
      # t = ii1()
      for _ in range(t):
          main(_)
      
  # snippets
  # @f - for loop 
  # @bfs - breadth first search 
  # @Trie - Trie Data Structure 
  # @rangeupdatepointquery - range update
  # @DS - Disjoint Set
  # @seive - generate seive