#include <stdio.h>
#include <string.h>
#define swap(a,b) (a += b,b = a - b,a -= b)
#define MAX 2000000
#define INFTY (1 << 30)

void maxHeapify(int i);
int extract();
void increaseKey(int i, int key);
void insert(int key) ;


int size, A[MAX+1];

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


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

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

void maxHeapify(int i){
  int l, r, largest, t;
  l = 2*i;
  r = 2*i+1;
  if ( l <= size && A[l] > A[i] ) largest = l;
  else largest = i;
  if ( r <= size && A[r] > A[largest] ) largest = r;
  if ( largest != i ){
    t = A[i]; A[i] = A[largest]; A[largest] = t;
    maxHeapify(largest);
  }
}

