import java.util.HashSet; import java.util.Set; public class Main { private static void solve() { long a = nl(); long b = nl(); long c = nl(); long d = nl(); int n = ni(); long[][] p = new long[n][2]; for (int i = 0; i < n; i++) { p[i] = new long[] {nl(), nl()}; } long det = a * d - b * c; Set set = new HashSet<>(); if (det == 0) { long g = gcd(a, c); //b/a * g if (g != 0) { for (long[] v : p) { long x = v[0] % g; long y = v[1] * a - v[0] * b; set.add(x + ":" + y); } } else { g = gcd(b, d); for (long[] v : p) { long x = v[0] * b - v[1] * a; long y = v[1] % g; set.add(x + ":" + y); } } System.out.println(set.size()); } else { for (long[] v : p) { long s = v[0] * d - v[1] * c; long t = -v[0] * b + v[1] * a; long s2 = s % det; long t2 = t % det; if (s2 < 0) s2 += det; if (t2 < 0) t2 += det; long v0 = (a * s2 + c * t2) / det; long v1 = (b * s2 + d * t2) / det; set.add(v0 + ":" + v1); } System.out.println(set.size()); } } public static long invl(long a, long mod) { long b = mod; long p = 1, q = 0; while (b > 0) { long c = a / b; long d; d = a; a = b; b = d % b; d = p; p = q; q = d - c * q; } return p < 0 ? p + mod : p; } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } public static void main(String[] args) { new Thread(null, new Runnable() { @Override public void run() { long start = System.currentTimeMillis(); String debug = args.length > 0 ? args[0] : null; if (debug != null) { try { is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug)); } catch (Exception e) { throw new RuntimeException(e); } } reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768); solve(); out.flush(); tr((System.currentTimeMillis() - start) + "ms"); } }, "", 64000000).start(); } private static java.io.InputStream is = System.in; private static java.io.PrintWriter out = new java.io.PrintWriter(System.out); private static java.util.StringTokenizer tokenizer = null; private static java.io.BufferedReader reader; public static String next() { while (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new java.util.StringTokenizer(reader.readLine()); } catch (Exception e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } private static double nd() { return Double.parseDouble(next()); } private static long nl() { return Long.parseLong(next()); } private static int[] na(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = ni(); return a; } private static char[] ns() { return next().toCharArray(); } private static long[] nal(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nl(); return a; } private static int[][] ntable(int n, int m) { int[][] table = new int[n][m]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[i][j] = ni(); } } return table; } private static int[][] nlist(int n, int m) { int[][] table = new int[m][n]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { table[j][i] = ni(); } } return table; } private static int ni() { return Integer.parseInt(next()); } private static void tr(Object... o) { if (is != System.in) System.out.println(java.util.Arrays.deepToString(o)); } }