#include<stdio.h>

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

int H,A[MAX+1];

void maxHeapify(int);
int extract(void);
void increaseKey(int,int);
void insert(int);
void swap(int *,int *);

int main(){
  int key;
  char s[10];

  while(1){
    scanf("%s",s);
    if(s[0] == 'e' && s[1] == 'n')break;

    if(s[0] == 'i'){
      scanf("%d",&key);
      insert(key);
    }
    else printf("%d\n",extract());
  }

  return 0;
}

void maxHeapify(int i){ 
int l,r,larg,tmp;

  l = 2 * i;
  r = 2 * i + 1;

  if(l <= H && A[l] > A[i])larg = l;
  else larg = i;

  if(r <= H && A[r] > A[larg])larg = r;

  if(larg != i){
    tmp = A[i];
    A[i] = A[larg];
    A[larg] = tmp;
    maxHeapify(larg);
  }

}

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

void swap(int *a,int *b){
  int tmp;

  tmp = *a;
  *a = *b;
  *b = tmp;
}