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