#include<iostream>
#include<algorithm>
using namespace std;

struct student{
    int id;
    int score;
};

bool cmp(student a,student b)
{
    return a.score>b.score;
}

int main()
{
    student stu[1001];
    int n,num,k,i;
    while(scanf("%d",&num)!=EOF)
    {
        n=0;
        while(scanf("%d%d",&stu[n].id,&stu[n].score))
        {
            if(stu[n].id==0&&stu[n].score==0) break;
            n++;
        }
        sort(stu,stu+n,cmp);//½µÐò 
        for(i=0;i<n;i++)
            if(stu[i].id==num) break;
        k=i;
        i=0;
        while(stu[i].score!=stu[k].score)
			i++;
        printf("%d\n",i+1);
    }
    return 0;
}