#include <bits/stdc++.h>
using namespace std;
vector<long long int> adj[100001];
set<long long int> s;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void solve() {
  long long int n, i, j, k, d, mn = 0, sum = 0, sum1 = 0, w = 0, x3, x4;
  long long int l = 0, r, p = 0, q;
  map<float, long long int> m;
  double x1, x2;
  cin >> n >> x1 >> x2;
  set<double> s;
  vector<int> v1;
  double arr[n][2];
  for (i = 0; i < n; i++) {
    cin >> arr[i][0] >> arr[i][1];
    if (arr[i][0] - x1 == 0)
      v1.push_back(1);
    else {
      s.insert((arr[i][1] - x2) / (arr[i][0] - x1));
    }
  }
  v1.size() == 0 ? cout << s.size() : cout << s.size() + 1;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long int tt = 1.0 * clock();
  int t;
  t = 1;
  for (int y = 0; y < t; y++) {
    solve();
  }
  return 0;
}
