#include <bits/stdc++.h>

using namespace std;
ifstream in("pachete.in");
ofstream out("pachete.out");
const int nx=50002;
struct punct
{
    long double x;
    long double y;
    long double p;
};
punct v[50002],sediu;
long double panta (punct a, punct b)
{
    long double y=b.y-a.y;
    long double x=b.x-a.x;
    if(x==0)
    {
        if(y>0) return numeric_limits < long double > :: max();
        if(y<0) return numeric_limits < long double > :: min();
    }
    return y/x;
}
bool crit (const punct &a, const punct &b)
{
    return a.p<b.p;
}
int n;
int main()
{
    in>>n;
    in>>sediu.x>>sediu.y;
    for(int i=1; i<=n; i++)
    {
        in>>v[i].x>>v[i].y;
        v[i].p=panta(sediu,v[i]);
    }
    sort(v+1,v+1+n,crit);
    int sol=1;
    for(int i=1; i<n; i++)
        if(v[i].p!=v[i+1].p)
            sol++;
    out<<sol;
    return 0;
}