package contest190705; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashSet; import java.util.InputMismatchException; import java.util.Set; // (a c)(u) // (b d)(v) public class D { InputStream is; PrintWriter out; String INPUT = ""; void solve() { long a = nl(), b = nl(), c = nl(), d = nl(); int n = ni(); long[] x = new long[n]; long[] y = new long[n]; for(int i = 0;i < n;i++) { x[i] = ni(); y[i] = ni(); } long D = a*d-b*c; if(D != 0) { Set set = new HashSet<>(); for(int i = 0;i < n;i++) { long xx = (d*x[i]-c*y[i]) % D; if(xx < 0)xx += D; long yy = (-b*x[i]+a*y[i]) % D; if(yy < 0)yy += D; set.add(xx*114514810 + yy); } out.println(set.size()); }else if(a != 0) { long h = gcd(Math.abs(a), Math.abs(c)); Set set = new HashSet<>(); long aa = a/(Math.abs(a)/h); long bb = b/(Math.abs(a)/h); for(int i = 0;i < n;i++) { long g = x[i] / aa; x[i] -= g*aa; y[i] -= g*bb; set.add(x[i]*114514810 + y[i]); } out.println(set.size()); }else { long h = gcd(Math.abs(b), Math.abs(d)); Set set = new HashSet<>(); long aa = a/(Math.abs(b)/h); long bb = b/(Math.abs(b)/h); for(int i = 0;i < n;i++) { long g = y[i] / bb; x[i] -= g*aa; y[i] -= g*bb; set.add(x[i]*114514810 + y[i]); } out.println(set.size()); } } public static long gcd(long a, long b) { while (b > 0) { long c = a; a = b; b = c % b; } return a; } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new D().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }