#include<stdio.h>
#include<string.h>
#define M 2000000
#define INFTY (1<<30)

int H,A[M+1];

void maxHeapify(int i){
  int l,r,biggest,tmp;
  l=2*i;
  r=2*i+1;
  if(l<=H&&A[l]>A[i])
    biggest=l;
  else
    biggest=i;
  if(r<=H&&A[r]>A[biggest])
    biggest=r;
  if(biggest!=i){
    tmp=A[i];
    A[i]=A[biggest];
    A[biggest]=tmp;
    maxHeapify(biggest);
    }
}

int extract(){
  int maxvalue;
  if(H<1)return -INFTY;
  maxvalue = A[1];
  A[1] = A[N--];
  maxHeapify(1);
  return maxvalue;
}

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

void insert(int key){
  H++;
  A[H]=-INFTY;
  increKey(N,key);
}

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;
}