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

int H,A[MAX+1];

void maxHeapfy(int );
int extract(void);
void increaseKey(int ,int);
void insert(int);

int main(){
    int key;
    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",extract());
        }
    }
    return 0;
}

void maxHeapfy(int n){
    int left,right,largest;
    
    left=2*n;
    right=2*n +1;
    
    if(left<=H && A[left]>A[n]) largest = left;
    else largest = n;
    if(right<=H && A[right]>A[largest]) largest = right;
    
    if(largest != n){
        int x =A[n];
        A[n] = A[largest];
        A[largest] = x;
        maxHeapfy(largest);
    }
}

int extract(){
    int maxv;
    if(H<1) return -INFTY;
    maxv=A[1];
    A[1]=A[H--];
    maxHeapfy(1);
    return maxv;
}

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

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

