#include<stdio.h>
#define MAX 2000000
#define INFTY (1<<30)
int H = 0;
int A[MAX+1];
int right(int i){
  return 2*i + 1;
}
int left(int i){
  return 2 * i;
}
void swap(int *a,int *b){
  int tmp;
  tmp = *a;
  *a = *b;
  *b = tmp;
}
void MaxHeapify(int i){
  int l,r,largest;
  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){
    swap(&A[i],&A[largest]);
    MaxHeapify(largest);
  }
}
int extract(){
  int maxv;
  if(H < 1) return -INFTY;
  maxv = A[1];
  A[1] = A[H--];
  MaxHeapify(1);
  return maxv;
}

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

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

