#include<stdio.h>
  
int heap[2000000];
int size;
  
void max_heapify(int heap[], int i) {
    int l = 2 * i + 1;
    int r = 2 * i + 2;
    int largest;
  
    if (l <= size && heap[l] > heap[i]) {
        largest = l;
    } else {
        largest = i;
    }
    if (r <= size && heap[r] > heap[largest]) {
        largest = r;
    }
  
    if (largest != i) {
        int tmp = heap[i];
        heap[i] = heap[largest];
        heap[largest] = tmp;
        max_heapify(heap, largest);
    }
}
  
void insert(int k){
    int child = size;
    int parent = (child - 1) / 2;
  
    heap[size] = k;
  
    while(1){
        if(heap[parent] > heap[child] || child == 0)
            break;
        int tmp = heap[child];
        heap[child] = heap[parent];
        heap[parent] = tmp;
  
        child = parent;
        parent = (child - 1) / 2;
    }
  
    size++;
}
  
int extract_max(){
    int ret = heap[0];
    heap[0] = heap[size-1];
    size--;
    max_heapify(heap, 0);
    return ret;
}
  
int main(){
    char cmd[8];
    int k;
  
    while(1) {
        scanf("%s", cmd);
        if(cmd[0] == 'i'){
            scanf("%d", &k);
            insert(k);
        }else if(cmd[1] == 'x'){
            printf("%d\n", extract_max());
        }else{
            return 0;
        }
    }
}
