#include <stdio.h>
#include <stdlib.h>

#define MAX 2000000
#define INFTY (1<<30)

int H=0, A[MAX+1], i1, i2, L1;

void swap1(int a, int b){
  A[i1]=b;
  A[L1]=a;
}


void swap2(int a, int b){
  A[i2]=b;
  A[i2/2]=a;
}

void maxHeapify(int i){
  int l, r, largest;

  i1=i;

  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){
    L1=largest;
    swap1(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){

  i2=i;

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

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