#include<stdio.h>
#define  N 2000000
#define INF -2100000000

int h,a[N+1];

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

  if(l<=h&&a[l]>a[i]) largest=l;
  else largest=i;
  if(r<=h&&a[r]>a[largest]) largest=r;

  if(largest!=i){
    temp=a[i];
    a[i]=a[largest];
    a[largest]=temp;
    maxHeapify(largest);
  }
}

int extract(){
  int max;
  if(h<1) return INF;
  max=a[1];
  a[1]=a[h--];
  maxHeapify(1);
  return max;
}

void heapincreasekey(int i,int key){
  int temp;
  
  if(key<a[i]) return;
  a[i]=key;
  
  while(i>1&&a[i/2]<a[i]){
    temp=a[i];
    a[i]=a[i/2];
    a[i/2]=temp;
    i=i/2;
  }
}

void insert(int key){
  h++;
  a[h]=INF;
  heapincreasekey(h,key);
}

int main(){
  int key;
  char c[10];

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

