#include<iostream>
#include<set>
using namespace std;
long a,b,c,d;
long gcd(long a,long b){return b?gcd(b,a%b):a;}
int N;
set<pair<pair<long,long>,pair<long,long> > >S;
pair<long,long>f(pair<long,long>p)
{
	p.first=(p.first%p.second+p.second)%p.second;
	return p;
}
main()
{
	cin>>a>>b>>c>>d>>N;
	long t=a*d-b*c;
	int ans=N;
	for(int i=0;i<N;i++)
	{
		long x,y;cin>>x>>y;
		pair<long,long>p,q;
		if(t==0)
		{
			long A=gcd(a,c),B=gcd(b,d);
			if(A)
			{
				long X=x/A;
				x-=X*A;
				y-=X*B;
			}
			else
			{
				long X=y/B;
				x-=X*A;
				y-=X*B;
			}
			p=make_pair(x,y);
			q=make_pair(0,0);
		}
		else
		{
			p.first=d*x-c*y;
			q.first=-b*x+a*y;
			p.second=q.second=t;
			p=f(p);
			q=f(q);
		}
		ans-=S.find(make_pair(p,q))!=S.end();
		S.insert(make_pair(p,q));
	}
	cout<<ans<<endl;
}