#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* curr=head;
    while(curr->next != NULL && curr->next->priority>=priority){
        curr = curr->next;
    }
    newNode->next=curr->next;
    curr->next=newNode;
}
void deleteHighest(){
    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);
    if(N<=0){
        printf("Queue is empty\n");
        return 0;
    }
    for(int i=0;i<N;i++){
        char operation[10];
        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){
            deleteHighest();
        }
    }
    return 0;
}