#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= 1000000007;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % 1000000007;
    a = a * a % 1000000007;
  }
  return res;
}
int n, c, d;
double x, y, a, b, ans;
set<double> arr;
int main() {
  cin >> n >> x >> y;
  while (n--) {
    cin >> a >> b;
    if (a == x)
      c = 1;
    else if (y == b)
      d = 1;
    else
      arr.insert((b - y) / (a - x));
  }
  cout << arr.size() + c + d << endl;
}
