import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


long floor(long a, long m) {
  return a / m - ((a % m < 0) ? 1 : 0);
}

long A, B, C, D;
int N;
long[] X, Y;

void main() {
  try {
    for (; ; ) {
      A = readLong();
      B = readLong();
      C = readLong();
      D = readLong();
      N = readInt();
      X = new long[N];
      Y = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong();
        Y[i] = readLong();
      }
      
      auto ps = new Tuple!(long, long)[N];
      if (A * D == B * C) {
        const a = gcd(abs(A), abs(C));
        const b = gcd(abs(B), abs(D));
        debug {
          writeln(a, " ", b);
        }
        foreach (i; 0 .. N) {
          const k = (a != 0) ? floor(X[i], a) : floor(Y[i], b);
          ps[i] = tuple(X[i] - k * a, Y[i] - k * b);
        }
      } else {
        /*
          ((x, y) - k (A, B)) \times (C, D)
          = (D x - C y) - (A D - B C) k
        */
        if (A * D - B * C < 0) {
          C *= -1;
          D *= -1;
        }
        foreach (i; 0 .. N) {
          long x = X[i], y = Y[i];
          const k = floor(D * x - C * y, A * D - B * C);
          x -= k * A;
          y -= k * B;
          const l = floor(-(B * x - A * y), A * D - B * C);
          x -= l * C;
          y -= l * D;
          debug {
            writefln("(%s, %s) -> (%s, %s) -> (%s, %s)", X[i], Y[i], X[i] - k * A, Y[i] - k * B, x, y);
          }
          ps[i] = tuple(x, y);
        }
      }
      
      ps.sort;
      int ans = 1;
      foreach (i; 1 .. N) {
        if (ps[i - 1] != ps[i]) {
          ++ans;
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}