#include <bits/stdc++.h>
using namespace std;
int n;
int x[1005];
int y[1005];
bool v[1005];
int main() {
  cin >> n >> x[0] >> y[0];
  for (__typeof(n + 1) i = (1) - ((1) > (n + 1));
       i != (n + 1) - ((1) > (n + 1)); i += 1 - 2 * ((1) > (n + 1))) {
    cin >> x[i] >> y[i];
  }
  int count = n;
  for (int i = 1; i < n + 1; i++) {
    if (v[i]) continue;
    for (int j = 1; j < n + 1; j++) {
      if (j == i || v[j]) continue;
      int val = (y[j] - y[0]) * (x[i] - x[0]) - (y[i] - y[0]) * (x[j] - x[0]);
      if (val == 0) {
        count--;
        v[j] = true;
      }
    }
  }
  cout << count;
  return 0;
}
