#include<stdio.h>
#include <string.h>

int heap[2000001];
int have;

void up(int k)
{
	int save;
	while(k>1&&heap[k/2]<heap[k])
	{
		save=heap[k];
		heap[k]=heap[k/2];
		heap[k/2]=save;
		k=k/2;
	}
}

void down(int k)
{
	int i,save;
	while(2*k<=have)
	{
		i=2*k;
		if(i<have&&heap[i]<heap[i+1])
		{
			i++;
		}
		if(heap[k]>=heap[i])
		{
			break;
		}
		else
		{
			save=heap[k];
			heap[k]=heap[i];
			heap[i]=save;
			k=i;
		}
	}
}

void insert(int a)
{
	have++;
	heap[have]=a;
	up(have);
}

void extract()
{
	int save;
	if(have<1)
	{
		return;
	}
	save=heap[1];
	heap[1]=heap[have];
	heap[have]=save;
	have--;
	down(1);
	printf("%d\n",heap[have+1]);
	return;
}

int main(void)
{
	int N;
	int num;
	char get[10];
	have=0;

	while(1)
	{
		scanf("%s",get);
		if(strcmp(get,"end")==0)
		{
			break;
		}
		if(strcmp(get,"insert")==0)
		{
			scanf("%d",&num);
			insert(num);
		}
		if(strcmp(get,"extract")==0)
		{
			extract();
		}
	}


	return 0;
}

