#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using i64=int_fast64_t;
using pii=pair<int,int>;
using pll=pair<i64,i64>;
template <class T> constexpr T inf=numeric_limits<T>::max() / (T)2;
template <class T> using minheap=priority_queue<T,vector<T>,greater<T>>;
#define fir first
#define sec second
#define mkp make_pair
#define mkt make_tuple
#define emb emplace_back
#define emp emplace
#define all(v) begin(v),end(v)
void ios_untie() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}
void file_setup() {
    if(!freopen("stderr.txt","wt",stderr)) {
        std::cerr << "Failed to open the stderr file\n";
        freopen("CON","wt",stderr);
    }
    if(!freopen("stdout.txt","wt",stdout)) {
        std::cerr << "Failed to open the stdout file\n";
        freopen("CON","wt",stdout);
    }
    if(!freopen("stdin.txt","rt",stdin)) {
        std::cerr << "Failed to open the stdin file.\n";
        freopen("CON","rt",stdin);
    }
}
i64 binry(i64 ok, i64 ng, const function<bool(i64)> &f) {
    while(abs(ok-ng)>1) {
        i64 mid=(ok+ng)/2;
        (f(mid) ? ok : ng) = mid;
    }
    return ok;
}

i64 gcd(i64 x,i64 y) {
    return y?gcd(y,x%y):x;
}

i64 a,b,c,d;
int n;
pll cit[1<<17];

void solve() {
    i64 det=abs(a*d-b*c);
    int ans;
    if(det) {
        set<pll> S;
        for(int i=0; i<n; ++i) {
            i64 x,y; tie(x,y)=cit[i];
            S.emplace(((d*x-c*y)%det+det)%det,((a*y-b*x)%det+det)%det);
        }
        ans=S.size();
    } else {
        i64 g=gcd(a,c);
        i64 g2=gcd(b,d);
        set<pll> S;
        for(int i=0; i<n; ++i) {
            i64 x,y; tie(x,y)=cit[i];
            if(g) S.emplace(a*y-b*x,x%g);
            else S.emplace(a*y-b*x,y%g2);
        }
        ans=S.size();
    }
    cout<<ans<<"\n";
}

signed main() {
    ios_untie();
#ifdef LOCAL
    file_setup();
#endif

    cin>>a>>b>>c>>d>>n;
    for(int i=0; i<n; ++i) {
        cin>>cit[i].fir>>cit[i].sec;
    }
    solve();
}