#include<stdio.h>

int h, A[2000001];

void maxHeapify(int i) {
	int temp;
	int l,r,largest;
	l = 2*i;
	r = 2*i+1;

	if(l<=h && A[l] > A[i]) largest = l;
	else largest = i;
	if(r<=h && A[r]>A[largest]){ largest = r; }
	if(largest != i){
		temp = A[i];
		A[i] = A[largest];
		A[largest] = temp;
		maxHeapify(largest);
	} 
}

int extract() {
	int maxv;
	if (h < 1) return;
	maxv = A[1];
	A[1] = A[h--];
	maxHeapify(1);
	return maxv;
}

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

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

main() {
	int key;
	char com[20];
	while (1) {
		scanf("%s", com);
		if (com[0] == 'i') {
			scanf("%d", &key);
			insert(key);
		}
		else if (strcmp(com, "extract") == 0) {
			printf("%d\n", extract());
		}
		else break;
	}

	return 0;
}
