#include <fstream>
#include <cmath>
#include <algorithm>

using namespace std;

struct el
{
    int x, y, d;
};

ifstream in("pachete.in");
ofstream out("pachete.out");
int n, ans;
int x, y;
el v[50005];
int viz[50005];

bool cmp(const el &a, const el &b)
{
    return a.d > b.d;
}

int main()
{
    in>>n;

    in>>x>>y;
    for(int i = 1; i<=n; i++)
    {
        in>>v[i].x>>v[i].y;

        v[i].d = abs(v[i].x - x) + abs(v[i].y - y);
    }

    sort(v+1, v+n+1, cmp);

    for(int i = 1; i<=n; i++)
    {
        if(viz[i] == 0)
        {
            viz[i] = 1;
            ans++;

            for(int j = i + 1; j<=n; j++)
            {
                if(v[j].x >= min(x, v[i].x) && v[j].x <= max(x, v[i].x) && v[j].y >= min(y, v[i].y) && v[j].y <= max(y, v[i].y))
                {
                    viz[j] = 1;
                }
            }
        }
    }

    out<<ans;

    return 0;
}