#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }


int main() {
  ll a, b, c, d; cin >> a >> b >> c >> d;
  if (a<0||(a==0&&b<0)) { a*=-1; b*=-1; }
  if (c<0||(c==0&&d<0)) { c*=-1; d*=-1; }

  ll N; cin >> N;
  ll x[N], y[N]; rep(i,N) cin >> x[i] >> y[i];

  set<p_ll> coord;
  if (a*d-b*c==0) {
    if (a==0) { swap(a,b); swap(c,d); rep(i,N) swap(x[i],y[i]); }
    ll g = gcd(a,c); b = b * g/a; a = g;
    rep(i,N) {
      ll xp = (x[i]%a+a) % a;
      ll yp = y[i] + (xp-x[i])/a*b;
      coord.insert(make_pair(xp,yp));
      // cout << xp << "," << yp << endl;
    }
  }
  else {
    ll n = abs(a*d-b*c);
    rep(i,N) {
      ll xp = ((d*x[i]-c*y[i])%n+n) % n;
      ll yp = ((a*y[i]-b*x[i])%n+n) % n;
      coord.insert(make_pair(xp,yp));
      // cout << xp << "," << yp << endl;
    }
  }

  ll result = coord.size();
  cout << result << endl;
  return 0;
}