#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
  ifstream f("pachete.in");
  ofstream g("pachete.out");
double v[50003];
struct punct
{
    int x,y;
};
int main()
{
    int n,lv=0;
    punct in,pct;
    f>>n;
    f>>in.x>>in.y;
    for(int i=1;i<=n;i++)
    {
        f>>pct.x>>pct.y;
        v[++lv]=(pct.x-in.x)*1.0/(pct.y-in.y);
    }
    int nrl=1;
    sort(v+1,v+lv+1);
    for(int i=2;i<=lv;i++)
        if(v[i]!=v[i-1])
         nrl++;
    g<<nrl;
    return 0;
}