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 java.util.*;
  import java.lang.*;
  import java.io.*;
  import java.math.BigInteger;
  import java.text.DecimalFormat;
  
  public final class Solution {
  
      static int inf = Integer.MAX_VALUE;
      static long mod = 1000000000 + 7;
  
   static void ne(Reader sc, BufferedWriter op) throws Exception {
      int n=sc.nextInt();
      HashMap<Integer,Pnode> hm = new HashMap<>();
      int c=0;
       while(n-->0){
          //  print(hm+" "+(n+1));
           int t=sc.nextInt();
           if(t==1){
               int x=sc.nextInt();
               if(hm.containsKey(x)){
                  //  print(x);
                  Pnode pn = hm.get(x);
                  Node curr=new Node(c++,pn.l);
                  pn.l=curr;
                  hm.put(x,pn);
                   
               }else{
                    Pnode np= new Pnode();
                    Node nn= new Node(c++,null);
                    np.l=nn;
                    np.r=nn;
                    hm.put(x,np);
                    
               }
           }else{
               
               int x=sc.nextInt();
               int y=sc.nextInt();
               if(!hm.containsKey(x)){ continue;}
               if(x==y){ continue;}
  
               Pnode px=hm.get(x);
              if(hm.containsKey(y)){
                  Pnode py=hm.get(y);
                  // Pnode px=hm.get(x);
                  py.r.next=px.l;
                  py.r=px.r;
                  hm.put(y,py);
                  hm.remove(x);
  
              }else{
                  hm.put(y,hm.get(x));
                  hm.remove(x);
              }
                 
              
           }
          
       }
       int[] arr= new int[c];
  
      for(int no : hm.keySet()){
          Pnode pn=hm.get(no);
          Node curr=pn.l;
          while(curr!=null){
              arr[curr.id]=no;
              curr=curr.next;
          }
      }
      for(int i=0;i<c;i++){
          op.write(arr[i]+" ");
      }
      op.write("\n");
  
       
       
   }
   static class Pnode{
       Node l;
       Node r;
     
   }
    static class Node{
       int id;
       Node next;
       public Node(int id, Node next){
             this.id=id;
             this.next=next;
       }
  
   }
  
  
  
    static int gcd(int a, int b)
      {
          if (a == 0)
              return b; 
          return gcd(b % a, a); 
      }
     public static boolean powerOfTwo(long n)
      {
          long no=n;
           while(no%2==0 && n>1){
               no/=2;
           }
           if(no==1){
               return true;
           }
           return false;
      }
  
      public static void main(String[] args) throws Exception {
          BufferedWriter op = new BufferedWriter(new OutputStreamWriter(System.out));
          Reader sc = new Reader();
          // Scanner sc= new Scanner(System.in);
          // int t = sc.nextInt();
          // while (t-->0){ ne(sc, op); }
          
          ne(sc,op);
             
                     
          op.flush();
      }
  
      static void print(Object o) {
          System.out.println(String.valueOf(o));
      }
      static int[] toIntArr(String s){
          int[] val= new int[s.length()];
          for(int i=0;i<s.length();i++){
              val[i]=s.charAt(i)-'a';
          }
          return val;
      }
  
      static void  sort(int[] arr){
          ArrayList<Integer> list= new ArrayList<>();
          for(int i=0;i<arr.length;i++){
              list.add(arr[i]);
  
          }
          Collections.sort(list);
          for(int i=0;i<arr.length;i++){
              arr[i]=list.get(i);
          }
      }
         static void  sort(long[] arr){
          ArrayList<Long> list= new ArrayList<>();
          for(int i=0;i<arr.length;i++){
              list.add(arr[i]);
  
          }
          Collections.sort(list);
          for(int i=0;i<arr.length;i++){
              arr[i]=list.get(i);
          }
      }
  
  }
  
  
  
  // return -1 to put no ahed in array
  class pair {
      int  xx;
      int yy;
      pair(int xx, int yy ) {
          this.xx = xx;
          this.yy = yy;
      }
  }
  
  
  class sortY implements Comparator<pair> {
      public int compare(pair p1, pair p2) {
          if (p1.yy > p2.yy) {
              return 1;
          } else if (p1.yy == p2.yy) {
              if (p1.xx > p2.xx) {
                  return 1;
              } else if (p1.xx < p2.xx) {
                  return -1;
              }
              return 0;
  
          }
          return -1;
      }
  }
  
  class sortX implements Comparator<pair> {
      public int compare(pair p1, pair p2) {
          if (p1.xx > p2.xx) {
              return 1;
          } else if (p1.xx == p2.xx) {
              if (p1.yy > p2.yy) {
                  return 1;
              } else if (p1.yy < p2.yy) {
                  return -1;
              }
              return 0;
  
          }
          return -1;
      }
  }
  
  class debug {
  
      static void print1d(long[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.print(arr[i] + " ");
          }
  
      }
  
      static void print1d(int[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.println(i+" = "+arr[i]);
          }
  
      }
  
      static void print1d(boolean[] arr) {
          System.out.println();
          for (int i = 0; i < arr.length; i++) {
              System.out.println(i + "= " + arr[i]);
          }
  
      }
  
      static void print2d(int[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
  
      static void print2d(long[][] arr) {
          System.out.println();
          int n = arr.length;
          int n2 = arr[0].length;
          for (int i = 0; i < n; i++) {
              for (int j = 0; j < n2; j++) {
                  System.out.print(arr[i][j] + " ");
              }
              System.out.println();
          }
  
      }
       static void printPair(ArrayList<pair> list) {
          if(list.size()==0){
              System.out.println("empty list");
              return;
          }
         System.out.println();
         for(int i=0;i<list.size();i++){
            System.out.println(list.get(i).xx+"-"+list.get(i).yy);
         }
      }
  
  }
  
  class Reader {
      final private int BUFFER_SIZE = 1 << 16;
      private DataInputStream din;
      private byte[] buffer;
      private int bufferPointer, bytesRead;
  
      public Reader() {
          din = new DataInputStream(System.in);
          buffer = new byte[BUFFER_SIZE];
          bufferPointer = bytesRead = 0;
      }
  
      public Reader(String file_name) throws IOException {
          din = new DataInputStream(new FileInputStream(file_name));
          buffer = new byte[BUFFER_SIZE];
          bufferPointer = bytesRead = 0;
      }
  
      public String readLine() throws IOException {
          byte[] buf = new byte[64]; // line length
          int cnt = 0, c;
          while ((c = read()) != -1) {
              if (c == '\n') {
                  if (cnt != 0) {
                      break;
                  } else {
                      continue;
                  }
              }
              buf[cnt++] = (byte) c;
          }
          return new String(buf, 0, cnt);
      }
  
      public int nextInt() throws IOException {
          int ret = 0;
          byte c = read();
          while (c <= ' ') {
              c = read();
          }
          boolean neg = (c == '-');
          if (neg)
              c = read();
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
  
          if (neg)
              return -ret;
          return ret;
      }
  
      public long nextLong() throws IOException {
          long ret = 0;
          byte c = read();
          while (c <= ' ')
              c = read();
          boolean neg = (c == '-');
          if (neg)
              c = read();
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
          if (neg)
              return -ret;
          return ret;
      }
  
      public double nextDouble() throws IOException {
          double ret = 0, div = 1;
          byte c = read();
          while (c <= ' ')
              c = read();
          boolean neg = (c == '-');
          if (neg)
              c = read();
  
          do {
              ret = ret * 10 + c - '0';
          } while ((c = read()) >= '0' && c <= '9');
  
          if (c == '.') {
              while ((c = read()) >= '0' && c <= '9') {
                  ret += (c - '0') / (div *= 10);
              }
          }
  
          if (neg)
              return -ret;
          return ret;
      }
  
      private void fillBuffer() throws IOException {
          bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
          if (bytesRead == -1)
              buffer[0] = -1;
      }
  
      private byte read() throws IOException {
          if (bufferPointer == bytesRead)
              fillBuffer();
          return buffer[bufferPointer++];
      }
  
      public void close() throws IOException {
          if (din == null)
              return;
          din.close();
      }
  }
   class MultiTreeSet<E> {
  	TreeMap<E, Integer> freqTreeMap = new TreeMap<E, Integer>();
  	int size;
   
  	public MultiTreeSet() {}
   
  	public MultiTreeSet(Collection<? extends E> c) {
  		for(E element : c)
  			add(element);
  	}
   
  	public int size() {
  		return size;
  	}
   
  	public void add(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq==null)
  			freqTreeMap.put(element, 1);
  		else
  			freqTreeMap.put(element,freq+1);
  		++size;
  	}
   
  	public void remove(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq!=null) {
  			if(freq==1)
  				freqTreeMap.remove(element);
  			else
  				freqTreeMap.put(element, freq-1);
  			--size;
  		}
  	}
   
  	public int get(E element) {
  		Integer freq = freqTreeMap.get(element);
  		if(freq==null)
  			return 0;
  		return freq;
  	}
   
  	public boolean contains(E element) {
  		return get(element)>0;
  	}
   
  	public boolean isEmpty() {
  		return size==0;
  	}
   
  	public E first() {
  		return freqTreeMap.firstKey();
  	}
   
  	public E last() {
  		return freqTreeMap.lastKey();
  	}
   
  	public E ceiling(E element) {
  		return freqTreeMap.ceilingKey(element);
  	}
   
  	public E floor(E element) {
  		return freqTreeMap.floorKey(element);
  	}
   
  	public E higher(E element) {
  		return freqTreeMap.higherKey(element);
  	}
   
  	public E lower(E element) {
  		return freqTreeMap.lowerKey(element);
  	}
  }
   