#include <bits/stdc++.h>
using namespace std;
int n;
int xo, yo;
int x, y;
vector<pair<int, int> > v;
int freq[10005];
int k;
int counter = 0;
int main() {
  cin >> n >> xo >> yo;
  for (int i = 0; i < n; i++) {
    cin >> x >> y;
    v.push_back(make_pair(x, y));
  }
  for (int i = 0; i < n; i++) {
    v[i].first -= xo;
    v[i].second -= yo;
    if (v[i].first == 0) {
      freq[i] = 1;
    }
    if (v[i].second == 0) {
      freq[i] = 2;
    }
  }
  k = 3;
  for (int i = 0; i < n - 1; i++) {
    if (freq[i] == 0) {
      freq[i] = k;
      for (int j = i + 1; j < n; j++) {
        if (freq[j] == 0) {
          if (v[i].first * v[j].second == v[i].second * v[j].first) {
            freq[j] = k;
          }
        }
      }
    }
    k++;
  }
  sort(freq, freq + n);
  counter = 1;
  for (int i = 1; i < n; i++) {
    if (freq[i] != freq[i - 1]) {
      counter++;
    }
  }
  cout << counter << endl;
  return 0;
}
