#include <stdio.h>
int p=0;
int q[2000001];

void swap(int,int);
void insert(int);
int extract();
int max_index(int,int);

int main()
{
  char cmd[10];
  int i,j;
  int k;
  while(1)
  {
    scanf("%s",cmd);
    if(cmd[0]=='i')
    {
      scanf("%d",&k);
      insert(k);
    }
    if(cmd[0]=='e')
    {
      if(cmd[1]=='x')
	printf("%d\n",extract());
      if(cmd[1]=='n') break;
    }
  }
  return 0;
}

void swap(int a,int b)
{
  int tmp;
  tmp=q[a];
  q[a]=q[b];
  q[b]=tmp;
}

void insert(int k)
{
  int tmp;
  int i,j;
  p++;
  q[p]=k;
  i=p;
  while(q[i]>q[i/2] && i>1)
  {
    swap(i,i/2);
    i=i/2;
  }
}

int extract()
{
  int ret=q[1];
  int i;
  int tmp;
  int M;
  q[1]=q[p];
  p--;
  i=1;
  while(i*2 <= p )
  {
    if(i*2+1 <= p)
      M=max_index(i*2,i*2+1);
    else M=i*2;
    if(max_index(M,i)==M){swap(M,i);i=M;}
    else break;
    
  }
  return ret;
}

int max_index(int a,int b)
{
  if(q[a]>q[b])return a;
  else return b;
}
