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

struct task{
    int id;
    int p;
};
struct task heap[MAX];
int size=0;
void swap(struct task *a , struct task *b){
    struct task temp=*a;
    *a=*b;
    *b=temp;
}
void heapy(int index){
    if(index<=0)
    return;
    int parent=(index-1)/2;
    if(heap[index].p<heap[parent].p){
        swap(&heap[index],&heap[parent]);
        heapy(parent);
    }
}
void insert(int id,int p){
    heap[size].id=id;
    heap[size].p=p;
    heapy(size);
    size++;
    printf("Task Added:%d\n",id);
}
int main(){
    int n;
    scanf("%d", &n);
    for(int i=0;i<n;i++){
    int id,p;
    scanf("%d%d",&id,&p);
    if(id<0 || p<0)
        printf("Invalid input");
        continue;
    }
        insert(id,p);
}
printf("Task with Highest Priority: %d\n",heap[0].id);
return 0;
}