#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()
#define dump(x) cout << #x << " = " << (x) << endl
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}
 
template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

int main() {
	ll a, b, c, d; cin >> a >> b >> c >> d;
	int N; cin >> N; 
	vector<pii> vec(N);
	rep(i, N) cin >> vec[i].fi >> vec[i].se;

	if (a * d == b * c) {
		ll p = __gcd(a, b);
		ll u = __gcd(a / p, c / p);
		ll e = a / p * u, f = b / p * u;
		set<pair<ll, ll>> st;

		rep(i, N) {
			ll md = 1e18;
			if (e != 0) md = vec[i].fi / e;
			if (f != 0) md = min(md, vec[i].se / f);
			st.insert(mp(vec[i].fi - md * e, vec[i].se - md * f));
		}
		cout << st.size() << endl;
	} else {
		set<pair<ll, ll>> st;

		ll z = abs(a * d - b * c);

		rep(i, N) {
			ll x = (vec[i].fi * d - vec[i].se * c);
			ll y = (-vec[i].fi * b + vec[i].se * a);
			x %= z;
			y %= z;
			if (x < 0) x += z;
			if (y < 0) y += z;
			st.insert(mp(x % z, y % z));
		}
		cout << st.size() << endl;
	}

	return 0;
}