#include <bits/stdc++.h>
using namespace std;
unordered_set<int> int_set;
set<int, greater<int> > divisors;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n, x, y;
  cin >> n >> x >> y;
  set<long double> s;
  int k = 0;
  for (int i = 0; i < n; i++) {
    int a, b;
    cin >> a >> b;
    long double temp;
    if (b != y) {
      temp = (long double)(x - a) / (y - b);
      if (!s.count(temp)) {
        s.insert(temp);
      }
    } else {
      k = 1;
    }
  }
  cout << s.size() + k << "\n";
  return 0;
}
