#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 insert(int id,int priority) {
    struct node* newnode=(Node*)malloc(sizeof(Node));
    newnode->id=id;
    newnode->priority=priority;
    newnode->next=NULL;
    
    if(head==NULL || priority>head->priority) {
        newnode->next=head;
        head=newnode;
    }
    else {
       if (temp=head)
        while(temp->next!=NULL && temp->next->priority)
             temp=temp->next;
        newnode->next=temp->next;
        temp->next=newnode;
    }
d deleteHighestPriority() {
    if(head==NULL) {
        printf("Invalid input");
        exit(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("Invalid input");
        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) {
            deleteHigestPriority();
        }
        else{
            printf("Invalid input");
            return 0;
        }
        
    }
    return 0;