#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
using pid = pair<int, double>;
using pLL = pair<ll, ll>;
using pll = pair<long int, long int>;
using pis = pair<int, string>;
using vL = vector<ll>;
using vi = vector<int>;
using vs = vector<string>;
using vd = vector<double>;
using vb = vector<bool>;
const double pi = acos(-1);
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
bool comp(const pii &a, const pii &b) { return a.second < b.second; }
void solve() {
  vector<pii> co;
  vi rad;
  int x1, x2, y1, y2, kombol = 0;
  int n;
  cin >> x1 >> y1 >> x2 >> y2 >> n;
  if (x1 > x2) swap(x1, x2);
  if (y1 > y2) swap(y1, y2);
  for (int i = 0; i < n; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    co.push_back({a, b});
    rad.emplace_back(c);
  }
  bool hobe;
  for (int i = x1; i <= x2; i++) {
    for (int j = y1; j <= y2; j++) {
      if (i == x1 or i == x2 or j == y1 or j == y2) {
        ;
        hobe = false;
        for (int k = 0; k < n; k++) {
          if (rad[k] * rad[k] >= (co[k].first - i) * (co[k].first - i) +
                                     (co[k].second - j) * (co[k].second - j)) {
            hobe = true;
            break;
          }
        }
        if (!hobe) kombol++;
      }
    }
  }
  cout << kombol << endl;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
  return 0;
}
