#include <bits/stdc++.h>
using namespace std;
struct node {
  double x, y;
  node(double a, double b) {
    x = a;
    y = b;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  vector<node> k;
  set<double> mp;
  double n, x, y, a, b;
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) {
    cin >> a >> b;
    k.push_back(node(a, b));
  }
  bool flag = false;
  for (int i = 0; i < n; i++) {
    if (x - k[i].x == 0) {
      flag = true;
      continue;
    }
    mp.insert((y - k[i].y) / (x - k[i].x));
  }
  if (flag)
    cout << mp.size() + 1 << endl;
  else
    cout << mp.size() << endl;
  return 0;
}
