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

int H,A[MAX +1];

void maxHeapify(int i){
	int l,r,largest;
	int copy = 0;
	
	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){
		copy = A[i];
		A[i] = A[largest];
		A[largest] = copy;
		maxHeapify(largest);
	}
}

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

void swap(int x,int y){
		int copy;
		copy = A[x];
		A[x] = A[y];
		A[y] = copy;
}

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

void insert(int key){
	H++;
	A[H] = -INFTY;
	increaseKey(H,key);
	
}
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;
	
}

