#include <stdio.h>
int p=1;
int q[2000000001];
int max_index(int a,int b){
  if(q[a]>q[b])return a;
  else return b;
}
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;
  q[p]=k;
  i=p;
  while(q[i]>q[i/2] && i>1){
    swap(i,i/2);
    i=i/2;
  }
  p++;
}
int extract(){
  int ret=q[1];
  int i;
  int tmp;
  int M;
  q[1]=q[p-1];
  p--;
  i=1;
  while(i<p){
    M=max_index(i*2,i*2+1);
    if(max_index(M,i)==M)swap(M,i);
    else break;
  }
  return ret;
}

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;
}