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.*;
import java.util.*;

/**
 * Created by tdx on 3/10/16.
 */
public class CF242C {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskX solver = new TaskX();
        solver.solve(1, in, out);
        out.close();
    }

    static class Pair implements Comparable<Pair> {
        Long f, s;

        public Pair(Long f, Long s) {
            this.f = f;
            this.s = s;
        }

        public Pair(int f, int s) {
            this.f = (long) f;
            this.s = (long) s;
        }

        @Override
        public int compareTo(Pair o) {
            if (f == o.f) return s.compareTo(o.s);
            return f.compareTo(o.f);
        }
    }

    static class TaskX {
        int n, cells = 0;
        static final int MAX = (int) 1e5;
        long d[];
        TreeMap<Pair, Integer> points = new TreeMap<>();
        Pair[] pairs = new Pair[2 * MAX + 10];

        static final int[] dr = {1, 1, 1, 0, 0, -1, -1, -1};
        static final int[] dc = {0, 1, -1,1, -1, 0, 1, -1};

        int getId(Pair p) {
            return points.get(p);
        }

        void addPoint(Pair p) {
            if (!points.containsKey(p)) {
                cells++;
                pairs[cells] = p;
                points.put(p, cells);
            }
        }

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            Pair start = new Pair(in.nextLong(), in.nextLong());
            Pair end = new Pair(in.nextLong(), in.nextLong());
            addPoint(start);
            addPoint(end);

            n = in.nextInt();
            int r, a, b;
            for (int i = 1; i <= n; ++i) {
                r = in.nextInt();
                a = in.nextInt();
                b = in.nextInt();
                for (int j = a; j <= b; ++j) {
                    Pair p = new Pair((long) r, (long) j);
                    addPoint(p);
                }
            }

            // Shortest path
            d = new long[cells + 5];
            Arrays.fill(d, Integer.MAX_VALUE);
            TreeSet<Pair> queue = new TreeSet<>();

            int start_id = getId(start);
            d[start_id] = 0;
            queue.add(new Pair(d[start_id], (long) start_id));

            while (!queue.isEmpty()) {
                Pair cur = queue.pollFirst();
                long d_cur = cur.f;
                long num = cur.s;
                Pair post = pairs[(int) num];

                for (int i = 0; i < 8; ++i) {
                    Pair p = new Pair(post.f + dr[i], post.s + dc[i]);
                    if (points.containsKey(p)) {
                        int id = getId(p);
                        if (d[id] > d_cur + 1) {
                            d[id] = d_cur + 1;
                            queue.add(new Pair(d[id], (long) id));
                        }
                    }
                }
            }

            int end_id = getId(end);

            if (d[end_id] == Integer.MAX_VALUE) {
                out.println(-1);
            } else {
                out.println(d[end_id]);
            }
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDoule() {
            return Double.parseDouble(next());
        }
    }
}
