#include <stdio.h>
#include <string.h>

int A[2000000];
int heap_size=0;

void maxHeapify(int i)
{
  int l, r, largest, max;
  l = i*2;
  r = i*2+1;

  if(l<=heap_size && A[l]>A[i])
    largest = l;
  else
    largest = i;
  if(r<=heap_size && A[r]>A[largest])
    largest = r;

  if(largest!=i){
    max = A[largest];
    A[largest] = A[i];
    A[i] = max;
    maxHeapify(largest);
  }
}

int heapExtractMax(void)
{
  int max;
  if(heap_size<1)
    return -1;
  max = A[1];
  A[1] = A[heap_size];
  heap_size--;
  maxHeapify(1);
  return max;
}

void heapIncreaseKey(int i,int key)
{
  int max;
  if(key<A[i])
    return ;
  
  A[i] = key;
  while(i>1 && A[i/2]<A[i]){
    max = A[i/2];
    A[i/2] = A[i];
    A[i] = max;
    i = i/2;
  }
}

void maxHeapInsert(int key)
{
  heap_size++;
  A[heap_size] = -1;
  heapIncreaseKey(heap_size,key);
}

int main()
{
  char str[20];
  int i=0, key;
  while(1){
    scanf("%s",str);
    if(str[2]=='d') break;
    else if(str[0]=='e'){
      printf("%d\n",heapExtractMax());
    }
    else{
      scanf("%d",&key);
      maxHeapInsert(key);
    }
  }

  return 0;
}