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

public class Main {
    public static void main(String[] args) throws IOException {
        FastScanner in = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);
        new Main().run(in, out);
        out.close();
    }

    int[] dx = {-1, -1, -1,  0, 0,  1, 1, 1};
    int[] dy = {-1,  0,  1, -1, 1, -1, 0, 1};
    HashMap<Integer, Set<Integer>> m;
    int sx, sy, tx, ty;
    void run(FastScanner in, PrintWriter out) {

        // bfs on allowed paths

        m = new HashMap<>();
        sx = in.nextInt();
        sy = in.nextInt();
        tx = in.nextInt();
        ty = in.nextInt();

        int n = in.nextInt();
        while (n-- > 0) {
            int r = in.nextInt();
            if (!m.containsKey(r)) {
                m.put(r, new HashSet<>());
            }
            Set<Integer> s = m.get(r);
            for (int a = in.nextInt(), b = in.nextInt(); a <= b; a++) {
                s.add(a);
            }
        }

        Set<Long> visited = new HashSet<>();

        // A*
        // {x, y, dist, distFromTarget (diagonal distance)}
        PriorityQueue<int[]> pq = new PriorityQueue<>((a, b) -> {
            return a[2]+a[3]-(b[2]+b[3]);
        });
        pq.offer(new int[] {sx, sy, 0, getDist(sx, sy)});

        boolean found = false;
        while (!pq.isEmpty()) {
            int[] top = pq.poll();
            int x = top[0];
            int y = top[1];
            int d = top[2];

            if (x == tx && y == ty) {
                out.println(d);
                found = true;
                break;
            }

            long key = getkey(x, y);
            if (visited.contains(key)) continue;
            visited.add(key);

            for (int i = 0; i < 8; i++) {
                int newx = x+dx[i];
                int newy = y+dy[i];
                if (!m.containsKey(newx)
                        || !m.get(newx).contains(newy)
                        || visited.contains(getkey(newx, newy))) continue;
                pq.add(new int[] {newx, newy, d+1, getDist(newx, newy)});
            }
        }
        if (!found) out.println(-1);
    }

    int getDist(int x, int y) {
        int xDiff = Math.abs(x-tx);
        int yDiff = Math.abs(y-ty);
        return xDiff + yDiff - Math.min(xDiff, yDiff);
    }

    long getkey(int x, int y) {
        return ((long)(10e9+1))*x + y;
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream in) {
            br = new BufferedReader(new InputStreamReader(in));
            st = null;
        }

        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());
        }
    }
}
