#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct Node
{
    int id;int priority;
    struct Node *next;
}Node;
struct Node *head=NULL;
void insertPatient(int id,int priority)
{
     Node*n =malloc(sizeof(Node));
     n->id=id;
     n->priority=priority;
     n->next=NULL;
    if(!head||priority>head->priority)
    {
       n->next=head;
       head=n;
       return;
    }
        Node* temp=head;
        while(temp->next!=NULL &&temp->next->priority==priority)
        temp=temp->next;
        n->next=temp->next;
        temp->next=n;
}
void deletePatient()
{
    if(!head)
    {
        printf("Queue is empty");
        return;
    }
    else
    {  printf("%d\n",temp->id);
    Node* temp=head;
    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,priority;
            scanf("%d %d",&id,&priority);
            insertPatient(id,priority);
        }
        else if(strcmp(op,"DELETE")==0)
        {
            deletePatient();
        }
        }
        return 0;
    }