#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<numeric>
using namespace std;
using ll=long long;
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
template<class T> bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}
template<class T> bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll a,b,c,d;
    cin>>a>>b>>c>>d;
    int N;
    cin>>N;
    vector<ll>X(N),Y(N);
    for(int i=0;i<N;i++)cin>>X[i]>>Y[i];
    if(a*d==b*c){
        set<pair<ll,ll>>se;
        ll g=gcd(a,c);
        for(int i=0;i<N;i++){
            ll p=b*X[i]-a*Y[i],q=X[i]%g;
            se.insert(make_pair(p,q));
        }
        cout<<se.size()<<"\n";
    }else{
        set<pair<ll,ll>>se;
        ll M=abs(a*d-b*c);
        for(int i=0;i<N;i++){
            ll p=(d*X[i]-c*Y[i])%M,q=(-b*X[i]+a*Y[i])%M;
            if(p<0)p+=M;
            if(q<0)q+=M;
            se.insert(make_pair(p,q));
        }
        cout<<se.size()<<"\n";
    }
}