#include <stdio.h>
#define INF 2000000 
int p = 0, q[INF];
 
int maxnumber(int x, int y){
  if(q[x]>q[y]){
    return x;
  }
  else{
    return y;
  }
}
 
void insert(int k){
    int i, j, temp;
    p++;
    q[p] = k;
    i = p;
    while(q[i]>q[i/2] && i>1){
        temp = q[i];
        q[i] = q[i/2];
        q[i/2] = temp;
        i = i/2;
    }
}
 
int extract(){
    int i, temp, max, a;
    a = q[1];
    q[1] = q[p];
    p--;
    i = 1;
    while(i*2<=p){
      if(i*2+1<=p) {
	max = maxnumber(i*2, i*2+1);
      }
      else{
	max =i*2;
      }
        if(maxnumber(max, i)==max){
            temp = q[max];
            q[max] = q[i];
            q[i] = temp;
            i = max;
        }
        else{
	  break;
	}
    }
    return a;
}
 
int main(){
    int i, j, k;
    char com[10];
    while(1){
        scanf("%s",com);
        if(com[0]=='i'){
            scanf("%d",&k);
            insert(k);
        }
        if(com[0]=='e' && com[1]=='x')  printf("%d\n",extract());
        if(com[0]=='e' && com[1]=='n')  break;
    }
    return 0;
}

