#include<stdio.h>
#define H 50000000
int A[H],size = 0;
int left(int);
int right(int);
int parent(int);
void maxHeapify(int);
void buildMaxHeap();
void insert(int);
int extract(void);
void increase(int);
int main() {
	int key,n = 0,j,ex[2000000],a;
	char com[20];
	while (1) {
		scanf("%s", com);
		if ('i' == com[0]) {
			scanf("%d", &key);
			insert(key);
		}
		else if ('e' == com[0] && com[1] == 'x') {
			ex[n++] = extract();
		}
		else if (com[0] == 'e' && com[1] == 'n') {
			break;
		}
	}
	for (j = 0; j < n;j++) {
		printf("%d\n",ex[j]);
	}
}
int left(int i) {
	return 2 * i;
}
int right(int i) {
	return 2 * i + 1;
}
int parent(int i) {
	return i / 2;
}
void maxHeapify(int i) {
	int swap;
	int largest, r, l;
	r = right(i);
	if (r > size) {
		A[r] = -2000000001;
	}
	l = left(i);
	if (l <= size && A[l] > A[i]) {
		largest = l;
	}
	else {
		largest = i;
	}
	if (r <= size && A[r] > A[largest]) {
		largest = r;
	}
	if (largest != i) {
		swap = A[i];
		A[i] = A[largest];
		A[largest] = swap;
		maxHeapify(largest);
	}
}
void buildMaxHeap() {
	int i;
	for (i = size / 2; i > 0; i--) {
		maxHeapify(i);
	}
}
void insert(int k) {
	size++;
	A[size] = k;
	increase(k);
}
void increase(int k) {
	int swap,i;
	i = size;
	while(i > 1 && A[parent(i)] < A[i]){
		swap = A[i];
		A[i] = A[parent(i)];
		A[parent(i)] = swap;
		i = parent(i);
	}
}
int extract() {
	int max;
	max = A[1];
	A[1] = A[size];
	size--;
	maxHeapify(1);
	return max;
}

