#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("pachete.in");
ofstream g("pachete.out");
int N,Result;
int length1,length2,length3,length4;
int Final[50005];
struct Point{
int x;
int y;
} Cadran1[50005],Cadran2[50005],Cadran3[50005],Cadran4[50005];
int initiala,initialo;
void Fill_Cadran(int abs,int ord)
{
    if(abs<initiala && ord>initialo)
        Cadran1[++length1].x=abs,Cadran1[length1].y=ord;
    if(abs>=initiala && ord>initialo)
        Cadran2[++length2].x=abs,Cadran2[length2].y=ord;
    if(abs<initiala && ord<=initialo)
        Cadran3[++length3].x=abs,Cadran3[length3].y=ord;
    if(abs>=initiala && ord<=initialo)
        Cadran4[++length4].x=abs,Cadran4[length4].y=ord;
}
void Read()
{
    int i;
    f>>N;
    f>>initiala>>initialo;
    for(i=1;i<=N;i++)
    {
        int abs,ord;
        f>>abs>>ord;
        Fill_Cadran(abs,ord);
    }
}
inline bool compare(Point a,Point b)
{
    if(a.x==b.x)
        return a.y<b.y;
    return a.x<b.x;
}
void Sort_Arrays()
{
    sort(Cadran1+1,Cadran1+length1+1,compare);
    sort(Cadran2+1,Cadran2+length2+1,compare);
    sort(Cadran3+1,Cadran3+length3+1,compare);
    sort(Cadran4+1,Cadran4+length4+1,compare);
}
void Binary_Search(int val)
{
    int st=1,dr=Final[0];
    int sol=Final[0]+1;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(val<Final[mid])
            st=mid+1;
        else
        {
            dr=mid-1;
            sol=mid;
        }
    }
    if(sol==Final[0]+1)
        Final[0]++,Result++;
    Final[sol]=val;
}
void Solve_Cadran(Point Cadran[],int N)
{
    if(N==0)
        return;
    Final[0]=0;
    Final[++Final[0]]=Cadran[1].y;
    Result++;
    for(int i=2;i<=N;i++)
        Binary_Search(Cadran[i].y);
}
int main()
{
    Read();
    Sort_Arrays();
    Solve_Cadran(Cadran1,length1);
    Solve_Cadran(Cadran2,length2);
    Solve_Cadran(Cadran3,length3);
    Solve_Cadran(Cadran4,length4);
    g<<Result<<"\n";
    return 0;
}