#include<bits/stdc++.h>
using namespace std;
int n,x,y;
int seen[50005],drumuri,a1,a2,b1,b2,st,dr,mid,sol,sol1;
pair<int,int> v[50005];
int main()
{
    freopen("pachete.in","r",stdin);
    freopen("pachete.out","w",stdout);
    scanf("%d",&n);
    scanf("%d%d",&x,&y);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&v[i].first,&v[i].second);
    }
    sort(v+1,v+n+1);
    for(int i=n;i>=1;i--)
    {
        if(!seen[i])
        {
            drumuri++;
            seen[i]=1;
            a1=min(x,v[i].first);
            a2=max(x,v[i].first);
            b1=min(y,v[i].second);
            b2=max(y,v[i].second);
            //cautare I
            st=1;
            dr=n;
            sol=0;
            while(st<=dr)
            {
                mid=(st+dr)>>1;
                if(v[mid].first>=a1)
                {
                    sol=mid;
                    dr=mid-1;
                }
                    else st=mid+1;
            }
            //
            //cautare II
            st=1;
            dr=n;
            sol1=0;
            while(st<=dr)
            {
                mid=(st+dr)>>1;
                if(v[mid].first<=a2)
                {
                    sol1=mid;
                    st=mid+1;
                }
                    else dr=mid-1;
            }
            //
            if(sol && sol1)
            {
                for(int j=sol;j<=sol1;j++)
                {
                    if(!seen[j] && v[j].second>=b1 && v[j].second<=b2)
                    {
                        seen[j]=1;
                    }
                }
            }
        }
    }
    printf("%d\n",drumuri);
    return 0;
}