#include<stdio.h>

#define MAX 2000000

int size, a[MAX+1];

void maxHeapify(int i){

  int l,r,large,t;
  
  l = 2*i;

  r = 2*i+1;

  if((l <= size) && (a[l] > a[i])){
    large = l;
  }
  
  else{
    large = i;
  }
  
  if((r <= size) && (a[r] > a[large])){
    large = r;
  }
  
  if(large != i){
    t = a[i];
    a[i] = a[large];
    a[large] = t;
    
    maxHeapify(large);
    
  }
  
}

int extract(){

  int maxv;

  if(size < 1){
    return;
  }
  
  maxv = a[1];
  
  a[1] = a[size--];
  
  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){

  size++;
  a[size] = -1000000001;

  increaseKey(size,key);
  
}

int main(){

  int key;
  char c[20];

  while(1){

    scanf("%s",c);
    if(c[0] == 'i'){

      scanf("%d",&key);
      

      insert(key);
    }

    else if(strcmp(c,"extract") == 0){
      printf("%d\n",extract());
    }

    else{
      break;
    }
    
  }

  return 0;

}

