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

import static java.lang.Integer.MAX_VALUE;
import static java.lang.Integer.valueOf;

public class KingPath {

    private static final List<Position> DIRECTIONS =
            Arrays.asList(new Position(1, 1), new Position(-1, -1),
                    new Position(-1, 1), new Position(1, -1),
                    new Position(0, 1), new Position(0, -1),
                    new Position(1, 0), new Position(-1, 0));

    public static void main(String[] args) throws IOException {
        try (BufferedReader reader = new BufferedReader(new InputStreamReader(System.in))) {
            String[] startAndEndPosition = reader.readLine().split(" ");
            Position start = new Position(valueOf(startAndEndPosition[0]), valueOf(startAndEndPosition[1]));
            Position end = new Position(valueOf(startAndEndPosition[2]), valueOf(startAndEndPosition[3]));
            Map<Integer, Collection<Integer>> allowedMoves = readAllowedMoves(reader);
            solve(start, end, allowedMoves);
        }
    }

    private static Map<Integer, Collection<Integer>> readAllowedMoves(BufferedReader reader) throws IOException {
        int rows = valueOf(reader.readLine());
        Map<Integer, Collection<Integer>> result = new HashMap<>(rows);
        while (rows-- > 0) {
            String row = reader.readLine();
            String[] line = row.split("\\s+");
            Collection<Integer> movesOrDefault = result.getOrDefault(valueOf(line[0]), createSet());
            IntStream.rangeClosed(valueOf(line[1]), valueOf(line[2])).forEach(movesOrDefault::add);
            result.put(valueOf(line[0]), movesOrDefault);
        }
        return result;
    }

    private static TreeSet<Integer> createSet() {
        return new TreeSet<>(Comparator.naturalOrder());
    }

    private static void solve(Position start, Position end, Map<Integer, Collection<Integer>> moves) {
        List<Position> visited = new ArrayList<>();
        LinkedList<Position> positions = new LinkedList<>();
        positions.addLast(start);
        visited.add(start);
        int result = MAX_VALUE;
        while (!positions.isEmpty()) {
            Position currentPosition = positions.removeFirst();

            for (Position direction : DIRECTIONS) {
                Position newPosition = new Position(currentPosition, direction);

                if (notAllowedToMove(moves, newPosition)) {
                    continue;
                }

                if (visited.contains(newPosition)) {
                    continue;
                }

                if (newPosition.equals(end) /*&& newPosition.step < result*/) {
                    result = newPosition.step;
                    System.out.println("DONE !!! ");
                    positions.clear();
                    break;
                }
                visited.add(newPosition);
                positions.addLast(newPosition);
            }
        }
        System.out.println(result == MAX_VALUE ? -1 : result);
    }

    private static boolean notAllowedToMove(Map<Integer, Collection<Integer>> moves, Position newPosition) {
        Collection<Integer> list = moves.getOrDefault(newPosition.row, Collections.emptySet());
        return !list.contains(newPosition.column);
    }

    private static class Position {
        int row;
        int column;
        int step;

        Position(int row, int column) {
            this(row, column, 0);
        }

        Position(Position position, Position direction) {
            this(position.row + direction.row, position.column + direction.column, position.step + 1);
        }

        Position(int row, int column, int step) {
            this.row = row;
            this.column = column;
            this.step = step;
        }

        @Override
        public boolean equals(Object o) {
            Position position = (Position) o;
            return row == position.row && column == position.column;
        }

        @Override
        public int hashCode() {
            return Objects.hash(row, column);
        }

        @Override
        public String toString() {
            return "Position{" + "row=" + row + ", column=" + column + ", step=" + step + '}';
        }
    }

}
