#include <bits/stdc++.h>
using namespace std;
bool eq(long long int x0, long long int y0, long long int x1, long long int y1,
        long long int x, long long int y) {
  long long int q = (x - x1);
  long long int r = (y1 - y0);
  long long int a = (y - y1);
  long long int b = (x1 - x0);
  long long int d = q * r - a * b;
  if (d == 0)
    return true;
  else
    return false;
}
int main() {
  long long int n, x0, y0, x1, y1;
  cin >> n >> x0 >> y0;
  vector<pair<long long int, pair<long long int, long long int>>> p;
  for (int i = 0; i < n; i++) {
    cin >> x1 >> y1;
    p.push_back(make_pair(0, make_pair(x1, y1)));
  }
  if (n == 1) {
    cout << "1";
    return 0;
  }
  long long int ans = 0;
  for (long long int i = 0; i < n - 1; i++) {
    if (p[i].first == 1)
      continue;
    else {
      p[i].first = 1;
      ans++;
    }
    for (long long int j = i + 1; j < n; j++) {
      if (eq(x0, y0, p[i].second.first, p[i].second.second, p[j].second.first,
             p[j].second.second))
        p[j].first = 1;
      else
        continue;
    }
  }
  if (p[n - 1].first == 0) ans++;
  cout << ans;
}
