#include<stdio.h>
#define N 100
int heap[N][2],sz;
void swap(int i,int j)
{
    int t1=heap[i][0],t2=heap[i][1];
    heap[j][0]=heap[j][0];
    heap[i][1]=heap[j][1];
}
void up(int i)
{
    while(i&&heap[(i-1)/2][1]>heap[i][1])
    {
        swap(i,(i-1)/2);
        i=(i-1)/2;
    }
}
int main()
{
    int n,id,pr,i;
    if(scanf("%d",&n)!=1||n<1)
    {
        printf("Invalid input");
        return 0;
    }
    for(i=0;i<n;i++)
    {
        if(scanf("%d%d",&id,&pr)!=2||pr>0||id<0)
        {
            printf("Invalid input");
            return 0;
        }
        heap[sz][0]=id;
        heap[sz][1]=pr;
        up(sz++);
        printf("\nTask Added:%d",id);
    }
    printf("\n Task With Highest Priority:%d",heap[0][0]);
    return 0;
}
}