#include <bits/stdc++.h>
int main() {
  long long int n, x, y, i, j, k = 0, s;
  scanf("%lld %lld %lld", &n, &x, &y);
  long long int X[n], Y[n];
  for (i = 0; i < n; i++) {
    scanf("%lld %lld", &X[i], &Y[i]);
    for (j = i - 1; j >= 0; j--) {
      s = x * Y[i] + X[i] * Y[j] + X[j] * y - X[i] * y - X[j] * Y[i] - x * Y[j];
      if (s == 0) {
        break;
      }
    }
    if (j < 0) {
      k++;
    }
  }
  printf("%lld\n", k);
  return 0;
}
