#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
long long mod(long long x, long long y) {
	return (x % y + y) % y;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	long long a, b, c, d; cin >> a >> b >> c >> d;
	int n; cin >> n;
	vector<long long>x(n), y(n);
	rep(i, n)cin >> x[i] >> y[i];
	long long det = abs(a * d - b * c);
	if (0 == det) {
		set<pair<long long, long long>>st;
		a = gcd(a, c);
		b = gcd(b, d);
		rep(i, n) {
			if (0 == a) {
				st.insert({ x[i],y[i] % b });
			}
			else {
				long long z = x[i] / a;
				x[i] -= z * a;
				y[i] -= z * b;
				st.insert({ x[i],y[i]});
			}
		}
		cout << st.size() << endl;
	}
	else {
		set<pair<long long, long long>>st;
		rep(i, n) {
			long long m0 = mod(d * x[i] - c * y[i], det);
			long long m1 = mod(-b * x[i] + a * y[i], det);
			st.insert({ m0,m1 });
		}
		cout << st.size() << endl;
	}
	return 0;
}