#include <stdio.h>
#define MAX 2000000000
#define INFTY (1 << 30)

void maxHeapify(int);
void insert(int);
void increaseKey(int, int);
int heapExtractMax(void);

int H, A[MAX];

void maxHeapify(int i)
{
  int l, r, largest, keep;
  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)
  {
    keep = A[i];
    A[i] = A[largest];
    A[largest] = keep;
    maxHeapify(largest);
  }
}

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

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

int heapExtractMax()
{
  int max;
  if (H < 1)
    return -INFTY;
  max = A[1];
  A[1] = A[H];
  H--;
  maxHeapify(1);
  return max;
}

int main()
{
  int key;
  A[H] = -INFTY;
  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", heapExtractMax());
    }
  }

  return 0;
}

