#include <iostream>
#include <map>
#include <cmath>
#include <utility>
using namespace std;
typedef long long ll;
ll x[100010],y[100010];
ll gcd(ll a, ll b){
	if(a<b) swap(a,b);
	if(b==0) return a;
	return gcd(a%b,b);
}

int main(){
	ll i,n,a,b,c,d;
	cin >> a >> b >> c >> d >> n;
	ll mod = abs(a*d - b*c);
	for(i=0;i<n;i++){
		cin >> x[i] >> y[i];
	}
	if(mod==0){
		ll e = gcd(a,c);
		map<ll,ll> mp;
		for(i=0;i<n;i++){
			mp[-a*x[i] + b*y[i]]++;
		}
		cout << mp.size() << endl;
	}else{
		map<pair<ll,ll>,ll> mp;
		for(i=0;i<n;i++){
			ll u = d*x[i]%mod - c*y[i]%mod,v = -b*x[i]%mod + a*y[i]%mod;
			if(u<0) u += mod;
			if(v<0) v += mod;
			mp[{u,v}]++;
		}
		cout << mp.size() << endl;
	}
}