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

#define MAX 2000000
#define INFTY (1<<30)

int H,A[MAX+1];

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

  if(l<=H && A[l]>A[i]) L=l;
  else L=i;
   if(r<=H && A[r]>A[L]) L=r;

   if(L!=i){
     x=A[i];
     A[i]=A[L];
     A[L]=x;
     maxHeapify(L);
   }
}

int extract(){
  int maxv,x;
  if (H<1) return -INFTY;
  maxv=A[1];
  A[1]=A[H--];
  maxHeapify(1);
  return maxv;
}

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

void insert(int key){
  H++;
  A[H]=-INFTY;
  increaseKey(H,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;
}

