#include <bits/stdc++.h>
using namespace std;
int a[10000][2], n, x, y, p = 0, t = 0;
double d, y2, x2;
vector<double> b;
int main() {
  cin >> n >> x >> y;
  for (int i = 0; i < n; i++) cin >> a[i][0] >> a[i][1];
  for (int i = 0; i < n; i++) {
    if ((y - a[i][1]) == 0)
      b.push_back(0);
    else if ((x - a[i][0]) == 0) {
      p = 1;
    } else {
      y2 = (y - a[i][1]);
      x2 = (x - a[i][0]);
      d = y2 / x2;
      b.push_back(d);
    }
  }
  if (b.size() > 0) {
    sort(b.begin(), b.end());
  }
  if (b.size() > 0) {
    for (int i = 0; i < b.size() - 1; i++) {
      if (b[i] != b[i + 1]) {
        t++;
      }
    }
    t++;
  }
  if (p == 1) {
    t++;
  }
  cout << t;
}
