#include<stdio.h>
#include<stdlib.h>
#define MAX 100

struct Task {
    int id;
    int priority;
};
struct Task heap[MAX];
int size=0;

void swap(struct Task *a,struct Task *b){
    struct Task temp = *a;
    *a=* b;
    *b=temp;
}
void heapifyUp(int index){
    if(index<=0)
    return;
    int parent=(index-1)/2;
    if(heap[index].priority<heap[parent].priority)
    swap(&heap[index],&heap[parent]);
        heapifyUp(parent);
    
    }

void insert(int id,int priority){
        heap[size].id=id;
        heap[size].priority=priority;
        heapifyUp(size);
        size++;
        printf("Task added:%d\n",id);
}
    
 

int main(){
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++){
        int id,priority;
        scanf("%d%d",&id,&priority);
            if(Task<0||priority<0){
             printf("Invalid Input\n");
              continue;
        }
        insert(Task,priority);
    }    
    
        printf("Task with highest priority:%d\n",heap[0].id);
        return 0;
             }