#include <bits/stdc++.h>
using namespace std;
inline int gcd(int a, int b) {
  int g;
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  if (a < b) {
    g = a;
    a = b;
    b = g;
  }
  if (b == 0) return a;
  g = a % b;
  while (g != 0) {
    a = b;
    b = g;
    g = a % b;
  }
  return b;
}
int main() {
  int n, a, b, c, d, i = 0, x, y, g;
  pair<int, int> p;
  set<pair<int, int> > s;
  set<pair<int, int> >::iterator it;
  scanf("%d%d%d", &n, &a, &b);
  while (n--) {
    scanf("%d%d", &c, &d);
    x = c - a;
    y = d - b;
    g = gcd(x, y);
    x /= g;
    y /= g;
    if (x == 0) y = 1;
    if (y == 0) x = 1;
    if (x < 0) {
      x = -x;
      y = -y;
    }
    p = make_pair(x, y);
    it = s.find(p);
    if (it != s.end())
      ;
    else {
      s.insert(p);
      i++;
    }
  }
  printf("%d\n", i);
  return 0;
}
