#include <stdio.h>
#include <string.h>
#define SIZE 2000000+1

void insert(int);
int extractMax();
void maxHeapify(int);
void swap(int *,int *);

int heep_size=1;
int A[SIZE];

int main(){
  char order[8];
  int n;

  while(1){
    scanf("%s",order);
    
    if(strcmp(order,"insert") == 0){
      scanf("%d",&n);
      insert(n);
    }
    
    else if(strcmp(order,"extract") == 0){
      int ma;
      ma = extractMax();
      printf("%d\n",ma);
    }
    
    else if(strcmp(order,"end") == 0){
      break;
    }  
  }

  return 0;
  
}

int extractMax(){
  int origin,ma;
  origin = 1;
  ma = A[origin];
  A[origin] = A[heep_size];
  heep_size--;
  maxHeapify(origin);

  return ma;
}

void insert(int key){
  int par,pos;
  heep_size++;
  A[heep_size] = key;
  pos = heep_size;
  par = pos/2;

  while(pos > 1 && A[pos] > A[par]){
    swap(&A[par],&A[pos]);
    pos = par;
    par /= 2;
  }
}
 
void swap(int *a,int *b){
  
  int tmp;
  tmp = *a;
  *a = *b;
  *b = tmp;
  
}

void maxHeapify(int i){
  int left,right,maximum;
  left = i*2;
  right = i*2+1;
  if(left <= heep_size && A[left] > A[i])
    maximum = left;
  else maximum = i;
  
  if(right <= heep_size && A[right] > A[maximum])
    maximum = right;
  
  if(maximum != i){
    swap(&A[i],&A[maximum]);
    maxHeapify(maximum);
  }

}

