#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int mod2 = 998244353;
void fact_init(int n);
long long exp(long long taban, long long us, long long md);
long long ebob(long long a, long long b);
long long ekok(long long a, long long b);
long long komb(long long a, long long b);
vector<long long> fact;
vector<long long> inv_fact;
void fact_init(int n) {
  fact.resize(n + 5);
  inv_fact.resize(n + 5);
  fact[0] = inv_fact[0] = 1;
  for (int i = 1; i <= n; i++) {
    fact[i] = (fact[i - 1] * i) % mod;
    inv_fact[i] = exp(fact[i], mod - 2, mod);
  }
}
long long exp(long long taban, long long us, long long md) {
  long long carpan = taban % md;
  if (carpan == 0) return 0;
  long long temp = us;
  long long res = 1;
  while (temp) {
    if (temp % 2) res = (res * carpan) % md;
    temp /= 2;
    carpan = (carpan * carpan) % md;
  }
  return res;
}
long long ebob(long long a, long long b) {
  if (!a) return b;
  return ebob(b % a, a);
}
long long ekok(long long a, long long b) { return (a * b) / ebob(a, b); }
long long komb(long long a, long long b) {
  if (a < b) return 0;
  return fact[a] * (inv_fact[a - b] * inv_fact[b] % mod) % mod;
}
const int N = 5e3 + 5;
struct line {
  long long a, b, c;
  void read() { cin >> a >> b >> c; }
};
struct point {
  int x, y;
  point() {}
  point(int x, int y) : x(x), y(y) {}
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  point home;
  cin >> home.x >> home.y;
  point uni;
  cin >> uni.x >> uni.y;
  int n;
  cin >> n;
  line ar[n];
  for (int i = 0; i < n; i++) ar[i].read();
  int res = 0;
  for (int i = 0; i < n; i++) {
    line& l = ar[i];
    bool taraf1 = l.a * home.x + l.b * home.y + l.c > 0;
    bool taraf2 = l.a * uni.x + l.b * uni.y + l.c > 0;
    res += taraf1 != taraf2;
  }
  cout << res << "\n";
}
