#include<stdio.h>
#include<stdlib.h>
#include<string.h>
struct node{
    int id;
    int pri;
    struct node*next;
};
struct node* head = NULL;
void inp(int id,int pri){
    struct node* newnode=(struct node*)malloc(sizeof(struct node));
    newnode->id=id;
    newnode->pri=pri;
    newnode->next=NULL;
    if(head==NULL||head->pri<pri){
        newnode->next=head;
        head=newnode;
    }
    else{
        struct node*temp=head;
        while(temp->next!=NULL &&temp->next->pri>=pri){
            temp=temp->newnode;
        }
        newnode->next->newnode;
    }
}
void de(){
    if(head==NULL){
        printf("Queue is empty\n");
        return 0;
    }
    struct node*temp-head;
    printf("%d\n",temp->id);
    head=head->next;
    free(temp);
}
int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        char op[10];
        scanf("%s",op);
        if(strcmp(op,"INSERT")==0){
            int id,pri;
            scanf("%d%d",&id,&pri);
            if(pri<0){
                printf("Invalid input");
                return 0;
            }
            inp(id,pri);
        }
        else if(strcmp(op,"DELETE")==0){
            de();
        }
        return 0;
    }
}