#include<stdio.h>
#include<string.h>
#define MAX 2000000
#define N 1000000000

int H,A[MAX+1];

void maxHeapify(int i){
  int a = 2 * i;
  int b = 2 * i  +1;
  int largest,t;
 
  if(a<=H && A[a]>A[i]) largest = a;
  else largest = i;
  if(b<=H && A[b]>A[largest]) largest = b;

  if(largest != i){
    t=A[i];
    A[i]=A[largest];
    A[largest]=t;
    maxHeapify(largest);
  }
}


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

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

    i = i / 2;
  }
}

void insert(int key) {
  H++;
  A[H] = -N;
  increaseKey(H, key);
}

int main(){
  int 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;
}

