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.*;


public class KingsPath {

    static class Point {

        private int x;
        private int y;

        public int getX() {
            return x;
        }

        public int getY() {
            return y;
        }

        Point(int x, int y) {
            this.x = x;
            this.y = y;
        }
    }

    private final int[] dx = {-1, 1, 0, 0, -1, -1, 1, 1};
    private final int[] dy = {0, 0, 1, -1, 1, -1, 1, -1};
    private final int MAX_CELLS = 1000000000;
    private HashMap<Integer, ArrayList<Point>> allowedCells;
    private HashMap<String, Integer> cellsCost;

    private boolean isValid(int row, int col) {
        return row >= 0 && col >= 0 && row < MAX_CELLS && col < MAX_CELLS && isAllowedCell(row, col);
    }

    private boolean isAllowedCell(int row, int col) {

        ArrayList<Point> points = allowedCells.get(row);

        if (points == null) {
            return false;
        }

        for (Point point : points) {
            if (col >= point.getX() && col <= point.getY()) {
                return true;
            }
        }
        return false;
    }



    private int bfs(int r0, int c0, int r1, int c1) {
        Queue<Integer> nextToVisit = new LinkedList<>();
        HashSet<String> visited = new HashSet<>();

        nextToVisit.add(r0);
        nextToVisit.add(c0);
        String initialElement = r0 + " " + c0;
        cellsCost.put(initialElement, 0);
        while (!nextToVisit.isEmpty()) {
            int rowElement = nextToVisit.remove();
            int colElement = nextToVisit.remove();
            String element = rowElement + " " + colElement;
            if (rowElement == r1 && colElement == c1) {
                return cellsCost.get(element);
            }
            if (visited.contains(element)) {
                continue;
            }
            visited.add(element);
            for (int i = 0; i < 8; i++) {
                int row = rowElement + dy[i];
                int col = colElement + dx[i];
                String rowAndCol = row + " " + col;
                if (!isValid(row, col)) {
                    continue;
                }
                nextToVisit.add(row);
                nextToVisit.add(col);
                cellsCost.putIfAbsent(rowAndCol, (cellsCost.get(element) + 1));
            }
        }
        return -1;
    }

    private void begin() {
        Scanner scanner = new Scanner(System.in);
        int x0 = scanner.nextInt();
        int y0 = scanner.nextInt();
        int x1 = scanner.nextInt();
        int y1 = scanner.nextInt();
        int n = scanner.nextInt();

        allowedCells = new HashMap<>();
        cellsCost = new HashMap<>();


        while (n-- > 0) {
            int row = scanner.nextInt();
            int col1 = scanner.nextInt();
            int col2 = scanner.nextInt();
            if (allowedCells.get(row) == null) {
                ArrayList<Point> points = new ArrayList<>();
                points.add(new Point(col1, col2));
                allowedCells.put(row, points);
            } else {
                allowedCells.get(row).add(new Point(col1, col2));
            }

        }

        int movesNumber = bfs(x0, y0, x1, y1);
        System.out.println(movesNumber);

    }

    public static void main(String[] args) {
        KingsPath path = new KingsPath();
        path.begin();
    }
}
