import sys sys.setrecursionlimit(10**6) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.buffer.readline()) def FI(): return float(sys.stdin.buffer.readline()) def MI(): return map(int, sys.stdin.buffer.readline().split()) def MF(): return map(float, sys.stdin.buffer.readline().split()) def MI1(): return map(int1, sys.stdin.buffer.readline().split()) def LI(): return list(map(int, sys.stdin.buffer.readline().split())) def LI1(): return list(map(int1, sys.stdin.buffer.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def BI(): return sys.stdin.buffer.readline().rstrip() def SI(): return sys.stdin.buffer.readline().rstrip().decode() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] inf = 10**16 # md = 998244353 md = 10**9+7 from math import gcd a, b, c, d = MI() n = II() xy = LLI(n) group = set() if a == c == 0: g = gcd(b, d) for x, y in xy: group.add((x, y%g)) elif b == d == 0: g = gcd(a, c) for x, y in xy: group.add((x%g, y)) elif a*d-b*c==0: g = gcd(a, c) for x, y in xy: group.add((x%g, y%g)) else: if c == 0: a, b, c, d = c, d, a, b for x, y in xy: m = (d*x-c*y+a*d-b*c-1)//(a*d-b*c) x, y = x-m*a, y-m*b m = x//c x, y = x-m*c, y-m*d group.add((x, y)) print(len(group))