#include<bits/stdc++.h>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
typedef long long ll;

ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    return b ? gcd(b,a%b) : a;
}
int main(){
    ll a,b,c,d;
    cin>>a>>b>>c>>d;
    int n;
    cin>>n;
    ll x[n],y[n];
    rep(i,n)cin>>x[i]>>y[i];
    map<pair<int,int>,int> mp;
    if(a*d==b*c){
        a=gcd(a,c);
        b=gcd(b,d);
        if(a==0){
            swap(a,b);
            rep(i,n)swap(x[i],y[i]);
        }
        rep(i,n){
            y[i]-=x[i]/a*b;
            x[i]%=a;
            mp[{x[i],y[i]}]++;
        }
    }
    else {
        ll ret=abs(a*d-b*c);
        rep(i,n){
            ll X=((d*x[i]-c*y[i])%ret+ret)%ret;
            ll Y=((-b*x[i]+a*y[i])%ret+ret)%ret;
            mp[{X,Y}]++;
        }
    }
    cout<<mp.size()<<endl;

    return 0;
}