#include<stdio.h>
#define MAX 2000010
#define NIL -2000000001
int k[MAX],size;

int Parent(int i){
  return i/2;
}

int Left(int i){
  return i*2;
}

int Right(int i){
  return i*2+1;
}


int maxHeapify(int i){
  int l,r,largest=NIL,e;
  l=Left(i);
  r=Right(i);
  if(l<=size && k[l]>k[i])
    largest=l;
  else largest=i;
  if(r<=size && k[r]>k[largest])
    largest=r;
  if(largest!=i){
    e=k[i];
  k[i]=k[largest];
  k[largest]=e;
  maxHeapify(largest);
  }
    }

int buildMaxHeap(){
  int i;
  for(i=size/2;i>=1;i--){
    maxHeapify(i);
  }    
}


int maxHeapInsert(int key){
  size=size+1;
  k[size]=NIL;
  heapIncreaseKey(size,key);
}

int heapIncreaseKey(int i, int key){
  int e;
  if(key<k[i]){
    return -1;
}
  k[i]=key;
  while(i>1 && k[Parent(i)]<k[i]){
    e=k[i];
  k[i]=k[Parent(i)];
  k[Parent(i)]=e;
  i=Parent(i);
  }
  
}

int heapExtractMax(){
  int max;
  if(size<1)
    return -1;
  max=k[1];
  k[1]=k[size];
  size=size-1;
  maxHeapify(1);
  return max;
}

main(){
  size=1;
  
  int i,j;
  char a[20];
  for(i=0;i<MAX;i++)
    k[i]=-(1<<29);

  while(1){

    scanf("%s", a);

    if(a[0]=='i')
      {
	scanf("%d",&j);

      maxHeapInsert(j);
      }
    else if(a[0]=='e' && a[1]=='x')
      printf("%d\n", heapExtractMax());
    else break;
  }

  return 0;
 
}