#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0;i<((int)(n));i++)
#define reg(i,a,b) for(int i = ((int)(a));i<=((int)(b));i++)
#define irep(i,n) for(int i = ((int)(n)-1);i>=0;i--)
#define ireg(i,a,b) for(int i = ((int)(b));i>=((int)(a));i--)
typedef long long ll;

/*
同値類に分ける
*/

ll a,b,c,d,n;
set<pair<ll,ll>> s;

long long gcd(long long a,long long b){
	if(b==0)return a;
	return gcd(b,a%b);
}

void init(){
	cin>>a>>b>>c>>d>>n;
	ll det=abs(a*d-b*c);
	ll g1=gcd(a,c);
	ll g2=gcd(b,d);
	rep(i,n){
		ll x,y;
		cin>>x>>y;
		if(det>0){
			s.insert({((d*x - c*y)%det + det)%det, ((-b*x + a*y)%det + det)%det});
		}else if(g1!=0){
			ll t=x/g1;
			if(x<0)t=t-1;
			s.insert({x-t*g1, y-t*g2});
		}else{
			ll t=y/g2;
			if(x<0)t=t-1;
			s.insert({x-t*g1, y-t*g2});
		}
	}
}

int main(void){
	init();
	cout<<s.size()<<endl;
	return 0;
}