#include <bits/stdc++.h>
using namespace std;
long long int a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v,
    w, x, y, z, sum = 0, total = 0, res = 0, ans = 0;
int main() {
  cin >> n >> a >> b;
  map<long long int, long long int> mp;
  long long int ar[n][2];
  for (long long int i = 0; i < n; i++)
    scanf("%lld %lld", &ar[i][0], &ar[i][1]);
  for (long long int i = 0; i < n; i++) {
    if (mp[i] == 0) {
      x = ar[i][0] - a;
      y = ar[i][1] - b;
      for (long long int j = i + 1; j <= n - 1; j++) {
        c = ar[j][0] - a;
        d = ar[j][1] - b;
        if (x * d == y * c) mp[j]++;
      }
      sum++;
    }
  }
  cout << sum << "\n";
}
