#include<stdio.h>
#include<limits.h>

int H,A[2000000];

void maxH(int);
int extract(void);
void increaseK(int,int);
void insert(int);

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

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

int extract(void){
	int max;
	if(H<1)return -INT_MAX;
	max=A[1];
	A[1]=A[H--];
	maxH(1);
	return max;
}

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

void insert(int key){
	H++;
	A[H]=-INT_MAX;
	increaseK(H,key);
}

