import java.util.Scanner;

public class heap2 {

  private static void Swap(long[] a, int i, int j) 
  { 
    long t = a[i];                                   
    a[i] = a[j];                                
    a[j] = t;                                    
  }

  private static void Heapify(long[] a, int size, int x)
  {
    while (2*x+1 < size) 
    {                        
      int t = 2*x+1;                                                                              
      if ((2*x+2 < size) && (a[2*x+1] < a[2*x+2])) 
      {
        t = 2*x+2;
      }
      if (a[x] < a[t])
      {
        Swap(a,x,t);
        x = t;
      } 
      else { break; }
    }		
  }

  private static long[] Build_Heap(long[] a)
  {
    int u = a.length;
    for (int i=u-1; i>=0; i--)
    {
      Heapify(a,u,i);
    }	
    return a;
  }

  public static void main(String[] args) 
  {
    Scanner scan = new Scanner(System.in);
    int n = scan.nextInt();
    long[] a = new long[100001];
    long[] b = new long[100001];
    String s[] = new String[100001];
    int k = 0;
    int q = 0;
    scan.nextLine();
    for (int i=0; i<n; i++)
    {
      s[i] = scan.nextLine();
      if (s[i].split(" ")[0].equals("Insert"))
      {
	a[k] = Integer.parseInt(s[i].split(" ")[1]);
	Build_Heap(a);
	k++;
      }
      if (s[i].split(" ")[0].equals("Extract")) 
      {
        b[q] = a[0];
	q++;
	Swap(a,0,k);
	a[k] = 0;
	k--;
	Heapify(a,k,0);
      }
    }
    for (int i=0; i<q; i++)
    {
      System.out.print(b[i]);
      System.out.print(" ");
    }
  }

}