#include<stdio.h>
#include<stdlib.h>
#define MAX 100
typedef struct{
    int id;
    int p;
}Task;
Task heap[MAX];int size=0;
void swap(Task*a,Task*b){
    Task t=*a;
    *a=*b;*b=t;
}
void heapify(int index){
    if(index<=0)return;
    int parent=(index-1)/2;
    if(heap[index].p<heap[parent].p){
        swap(&heap[index],&heap[parent]);
        heapify(parent);
    }
}
void insert(int id,int p){
    heap[size].id=id;
    heap[size].p=p;
    size++;
    printf("Task Added: %d\n",id);
}
int main(){
    int n;
    scanf("%d",&n);
    int id,p;
    for(int i=0;i<n;i++){
        if(scanf("%d %d",&id,&p)id<0||p<0){
            printf("Invalid Input\n");
            continue;
        }

    }
    insert(id,p);
    printf("Task with Highest Priority: %d\n",h[minIdx].id);
    return 0;
}