#include<stdio.h>
#define N 2000000
int x,a[N];

void heap(int i){
  int l,r,large,t;
  l=2*i;
  r=2*i+1;
  if(l<=x && a[l]>a[i]){
    large=l;
  }
  else large=i;
  if(r<=x && a[r]>a[large]){
    large=r;
  }
  if(large!=i){
    t=a[i];
    a[i]=a[large];
    a[large]=t;
    heap(large);
  }
}
int extract(){
  int max;
  if(x<1) return;
  max=a[1];
  a[1]=a[x--];
  heap(1);
  return max;
}
void increase(int i,int key){
  int swap;
  if(key<a[i]) return;
  a[i]=key;
   while(i>1 && a[i/2]<a[i]){
    swap=a[i];
    a[i]=a[i/2];
    a[i/2]=swap;
    i=i/2;
  }
}
void insert(int key){
  x++;
  a[x]=-10000000;
  increase(x,key);
}

int main(){
  int key;
  char c[10000];
  while(1){
         scanf("%s",c);
    if(strcmp(c,"end")==0) break;
    if(c[0]=='i'){
      scanf("%d",&key);
      insert(key);
    }
    else if(strcmp(c,"extract")==0){
      printf("%d\n",extract());
    }
    else break;
  }
  return 0;
}
