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;
int sx, sy, dx, dy, n, dis[100004];
map<pair<int, int>, int> mp;
int main() {
  cin >> sx >> sy >> dx >> dy;
  cin >> n;
  int i, j, cnt = 1;
  for (i = 0; i < n; i++) {
    int r, c1, c2;
    cin >> r >> c1 >> c2;
    for (j = c1; j <= c2; j++) {
      mp[{r, j}] = cnt;
      dis[cnt] = 1000000000;
      cnt++;
    }
  }
  mp[{dx, dy}] = cnt;
  dis[cnt] = 1000000000;
  queue<pair<int, int> > q;
  q.push({sx, sy});
  dis[mp[{sx, sy}]] = 0;
  while (!q.empty()) {
    int x = q.front().first;
    int y = q.front().second;
    q.pop();
    if (mp.find({x + 1, y}) != mp.end() &&
        dis[mp[{x + 1, y}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x + 1, y}]] = dis[mp[{x, y}]] + 1;
      q.push({x + 1, y});
    }
    if (mp.find({x - 1, y}) != mp.end() &&
        dis[mp[{x - 1, y}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x - 1, y}]] = dis[mp[{x, y}]] + 1;
      q.push({x - 1, y});
    }
    if (mp.find({x, y + 1}) != mp.end() &&
        dis[mp[{x, y + 1}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x, y + 1}]] = dis[mp[{x, y}]] + 1;
      q.push({x, y + 1});
    }
    if (mp.find({x, y - 1}) != mp.end() &&
        dis[mp[{x, y - 1}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x, y - 1}]] = dis[mp[{x, y}]] + 1;
      q.push({x, y - 1});
    }
    if (mp.find({x + 1, y + 1}) != mp.end() &&
        dis[mp[{x + 1, y + 1}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x + 1, y + 1}]] = dis[mp[{x, y}]] + 1;
      q.push({x + 1, y + 1});
    }
    if (mp.find({x - 1, y - 1}) != mp.end() &&
        dis[mp[{x - 1, y - 1}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x - 1, y - 1}]] = dis[mp[{x, y}]] + 1;
      q.push({x - 1, y - 1});
    }
    if (mp.find({x + 1, y - 1}) != mp.end() &&
        dis[mp[{x + 1, y - 1}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x + 1, y - 1}]] = dis[mp[{x, y}]] + 1;
      q.push({x + 1, y - 1});
    }
    if (mp.find({x - 1, y + 1}) != mp.end() &&
        dis[mp[{x - 1, y + 1}]] > dis[mp[{x, y}]] + 1) {
      dis[mp[{x - 1, y + 1}]] = dis[mp[{x, y}]] + 1;
      q.push({x - 1, y + 1});
    }
  }
  if (dis[mp[{dx, dy}]] == 1000000000) {
    cout << -1 << "\n";
  } else {
    cout << dis[mp[{dx, dy}]] << "\n";
  }
}
