#include <stdio.h>
#include <math.h>
#define MAX 2000000001
#define INF 2000000001
 
void maxHeapify(int i);
int extract();
void increaseKey(int,int);
void insert(int);
int H,A[MAX+1];
 
int main(){
  int key;
  char com[10];
 
  while(1){
      scanf("%s",com);
 
      if(com[0]=='e'&&com[1]=='n') break;
 
      if(com[0]=='i'){
          scanf("%d",&key);
          insert(key);
      }
      else{
          printf("%d\n",extract());
      }
  }
 
  return 0;
}
 
int parent(i){
  return floor(i/2);
}
 
int left(i){
  return 2*i;
}
 
int right(i){
  return 2*i+1;
}
 
void maxHeapify(int i){
  int l, r, largest, tmp;
  l=left(i);
  r=right(i);
 
  if(l<=H && A[l]>A[i]) largest=l;
  else largest=i;
  if(r<=H && A[r]>A[largest]) largest=r;
 
  if(largest!=i){
    tmp=A[i];
    A[i]=A[largest];
    A[largest]=tmp;
    maxHeapify(largest);
  }
}
 
int extract(){
    int max;
 
    if(H<1) return -INF;
 
    max=A[1];
    A[1]=A[H--];
    maxHeapify(1);
 
    return max;
}
 
void increaseKey(int i,int key){
    int tmp;
 
    if(key<A[i]) return;
 
    A[i]=key;
 
    while(i>1&&A[i/2]<A[i]){
        tmp=A[i];
        A[i]=A[i/2];
        A[i/2]=tmp;
 
        i/=2;
    }
}
 
void insert(int key){
    H++;
 
    A[H]=-INF;
 
    increaseKey(H,key);
}

