#include <bits/stdc++.h>
using namespace std;
int n, x[100010], y[100010];
int u[100010];
int main() {
  scanf("%d", &n);
  for (int i = 0; i <= n; ++i) scanf("%d%d", &x[i], &y[i]);
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    if (!u[i]) {
      ++ans;
      u[i] = 1;
      int X = x[i] - x[0], Y = y[i] - y[0];
      for (int j = 1; j <= n; ++j)
        if (X * 1LL * (y[j] - y[0]) == Y * (x[j] - x[0])) {
          u[j] = 1;
        }
    }
  }
  cout << ans << endl;
  return 0;
}
