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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class KingsPath {
    static int[] xx = {-1, -1, -1, 0, 0, 1, 1, 1},
            yy = {-1, 0, 1, -1, 1, -1, 0, 1};
    public static void main(String[] args) {
        FstScn sc = new FstScn();
        int x1 = sc.nextInt(), y1 = sc.nextInt();
        int x2 = sc.nextInt(), y2 = sc.nextInt();
        int n = sc.nextInt();
        HashMap<Pair, Integer> hm = new HashMap<>();
        HashMap<Pair, Boolean> visited = new HashMap<>();
        for (int i = 1; i <= n; ++i) {
            int r = sc.nextInt(), c1 = sc.nextInt(), c2 = sc.nextInt();
            for (int j = c1; j <= c2; ++j) {
                hm.put(new Pair(r, j), 1);
            }
        }
        Queue<Pair> q = new LinkedList<>();
        q.add(new Pair(x1, y1, 0));
        visited.put(new Pair(x1, y1), true);
        int flag = -1;
        while (!q.isEmpty()) {
            Pair it = q.remove();
            int steps = it.ti;
            int x = it.fi;
            int y = it.si;

            for (int i = 0; i < 8; ++i) {
                int newX = x + xx[i];
                int newY = y + yy[i];
                Pair p = new Pair(newX, newY);
                if (!visited.containsKey(p) && hm.get(p) != null) {
                    if (newX == x2 && newY == y2) {
                        flag = steps + 1;
                        break;
                    }
                    q.add(new Pair(newX, newY, steps + 1));
                    visited.put(p, true);
                }
            }
        }
        System.out.println(flag);
    }
    static class Pair {
        int fi, si, ti;
        public Pair(int fi, int si) {
            this.fi = fi;
            this.si = si;
        }
        public Pair(int fi, int si, int ti) {
            this.fi = fi;
            this.si = si;
            this.ti = ti;
        }
        public boolean equals(Object o) {
            if (this == o) return true;
            if (!(o instanceof Pair)) return false;
            Pair pair = (Pair) o;
            return fi == pair.fi && si == pair.si && ti == pair.ti;
        }
        public int hashCode() {
            return Objects.hash(fi, si, ti);
        }
    }
    static class FstScn {
        BufferedReader br;
        StringTokenizer st;
        public FstScn() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        double nextDouble() {
            return Double.parseDouble(next());
        }
        float nextFloat() {
            return Float.parseFloat(next());
        }
    }
}