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

#define SIZE 2000000

int A[SIZE];
int H;

void insert(int x)
{
  int tmp;
  A[H] = x;
  H++;
  int i=H-1;
  int parent = (i-1)/2;
  if (H<1) return;
  while (A[parent]<A[i]) {
    tmp = A[parent];
    A[parent] = A[i];
    A[i] = tmp;
    if (i==0) break;
    tmp = i;
    i = parent;
    parent = (tmp-1)/2;
  }
}

void maxHeapify(int i) {
  int largest, tmp;
  int l = (i+1)*2-1;
  int r = (i+1)*2;

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

  if (largest != i) {
    tmp = A[i];
    A[i] = A[largest];
    A[largest] = tmp;
    maxHeapify(largest);
  }
}
int extract()
{
  if (H<0) return -1;
  int val = A[0];
  A[0]=A[H-1];
  maxHeapify(0);
  H--;
  return val;
}


void print()
{
  int i, n=1;
  printf("[ ");
  while (1) {
    for (i=n-1; i<=(n-1)*2; i++) {
      if (i>=H) goto END;
      printf("%d ",A[i]);
    }
    printf("\n");
    n*=2;
  }
 END:
  printf("] H==%d\n", H);
}

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