1 1 1 2
5
1000000000 1 10000
19920401 1188 5566
1000000000 1 10000
1 1 10000
5 100 200
 6 15 7 15
9
6 15 15
7 14 14
6 15 15
9 14 14
7 14 16
6 15 15
6 15 15
7 14 14
8 15 15
 1 1 1000000000 2
5
1000000000 1 10000
19920401 1188 5566
1000000000 1 10000
1 1 10000
5 100 200
 89 29 88 30
16
87 31 31
14 95 95
98 88 89
96 88 88
14 97 97
13 97 98
100 88 88
88 32 32
99 88 89
90 29 29
87 31 31
15 94 96
89 29 29
88 32 32
97 89 89
88 29 30
 30 14 39 19
31
35 7 11
37 11 12
32 13 13
37 5 6
46 13 13
37 14 14
31 13 13
43 13 19
45 15 19
46 13 13
32 17 17
41 14 19
30 14 14
43 13 17
34 16 18
44 11 19
38 13 13
40 12 20
37 16 18
46 16 18
34 10 14
36 9 10
36 15 19
38 15 19
42 13 19
33 14 15
35 15 19
33 17 18
39 12 20
36 5 7
45 12 12
 9 8 7 8
9
10 6 6
10 6 6
7 7 8
9 5 6
8 9 9
9 5 5
9 8 8
8 5 6
9 10 10
 2 1 1 1
2
1 1 2
2 1 2
 13 16 20 10
18
13 16 16
20 10 10
19 10 10
12 15 15
20 10 10
18 11 11
19 10 10
19 10 10
20 10 10
19 10 10
20 10 10
20 10 10
19 10 10
18 11 11
13 16 16
12 15 15
19 10 10
19 10 10

1
 1
 -1
 1
 9
 2
 1
 -1

#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
#pragma GCC target("avx2,avx,fma")
inline long long long long int poww(long long long long int a,
                                    long long long long int b) {
  long long long long int r = 1LL;
  while (b > 0) {
    if (b & 1) r = r * a;
    b /= 2;
    a = a * a;
  }
  return (long long int)r;
}
template <class T>
inline void sary(T st, T nd) {
  while (st < nd) cin >> *st++;
}
long long int mod = 998244353;
inline long long long long int mul(long long long long int a,
                                   long long long long int b) {
  return ((a % mod) * (b % mod)) % mod;
}
inline long long long long int add(long long long long int a,
                                   long long long long int b) {
  return ((a % mod) + (b % mod)) % mod;
}
inline long long long long int sub(long long long long int a,
                                   long long long long int b) {
  return ((a % mod) - (b % mod) + mod) % mod;
}
inline long long long long int divi(long long long long int a,
                                    long long long long int b) {
  return (500000004 * (a % mod)) % mod;
}
const long long int N = 1e5 + 1;
long long int c = 0;
map<long long int, vector<long long int> > adj;
map<pair<long long int, long long int>, long long int> dict;
vector<pair<long long int, long long int> > v;
void join(long long int a, long long int b) {
  adj[a].push_back(b);
  adj[b].push_back(a);
}
long long int bfs(long long int u, long long int f) {
  if (u == f) return 0;
  bool vis[c];
  memset(vis, false, sizeof vis);
  long long int dist[c];
  memset(dist, 0, sizeof dist);
  queue<long long int> q;
  dist[u] = 0;
  q.push(u);
  vis[u] = true;
  while (!q.empty()) {
    long long int x = q.front();
    q.pop();
    for (auto i : adj[x]) {
      if (!vis[i]) {
        dist[i] = dist[x] + 1;
        q.push(i);
        vis[i] = true;
      }
    }
  }
  return (dist[f] == 0 ? -1 : dist[f]);
}
void solve() {
  long long int x1, y1, x2, y2, n;
  cin >> x1 >> y1 >> x2 >> y2 >> n;
  for (long long int i = 0; i < n; i++) {
    long long int r, a, b;
    cin >> r >> a >> b;
    for (long long int j = a; j <= b; j++) {
      if (dict.find({r, j}) != dict.end()) continue;
      if (r > 1) {
        if (j - 1 > 0 && dict.find({r - 1, j - 1}) != dict.end())
          join(c, dict[{r - 1, j - 1}]);
        if (dict.find({r - 1, j}) != dict.end()) join(c, dict[{r - 1, j}]);
        if (j + 1 <= 1e9 && dict.find({r - 1, j + 1}) != dict.end())
          join(c, dict[{r - 1, j + 1}]);
      }
      if (r + 1 <= 1e9) {
        if (j - 1 > 0 && dict.find({r + 1, j - 1}) != dict.end())
          join(c, dict[{r + 1, j - 1}]);
        if (dict.find({r + 1, j}) != dict.end()) join(c, dict[{r + 1, j}]);
        if (j + 1 <= 1e9 && dict.find({r + 1, j + 1}) != dict.end())
          join(c, dict[{r + 1, j + 1}]);
      }
      if (j != a) join(c, dict[{r, j - 1}]);
      v.push_back({r, j});
      dict[{r, j}] = c++;
    }
  }
  cout << bfs(dict[{x1, y1}], dict[{x2, y2}]);
}
int32_t main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long int t = 1;
  while (t--) solve();
}
