#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using P = pair<ll, ll>;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    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];
    }
    set<P> st;
    if(a*d-b*c == 0){
        ll gx = gcd(a, c);
        ll gy = gcd(b, d);
        for(int i = 0; i < n; i++){
            ll rx = (gx == 0 ? x[i] : x[i]%gx);
            ll ry = (gy == 0 ? y[i] : y[i]%gy);
            st.insert({rx, ry});
        }
    }else{
        ll p = abs(a*d-b*c);
        for(int i = 0; i < n; i++){
            ll X = d*x[i]-c*y[i];
            ll Y = b*x[i]-a*y[i];
            ll RX = ((X%p)+p)%p;
            ll RY = ((Y%p)+p)%p;
            st.insert({RX, RY});
        }
    }
    cout << st.size() << endl;
}