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

public class KingPath {


    public static HashMap<Integer, ArrayList<Point>> hashMap = new HashMap<>();
    public static HashMap<String, Boolean> visited = new HashMap<>();

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int x0 = s.nextInt();
        int y0 = s.nextInt();
        int x1 = s.nextInt();
        int y1 = s.nextInt();
        int segments = s.nextInt();
        int r,a,b;
        for (int i = 0; i < segments; i++) {
            r = s.nextInt();
            a = s.nextInt();
            b = s.nextInt();
            ArrayList<Point> points = hashMap.get(r);
            if(points == null) {
                points = new ArrayList<>();
                points.add(new Point(a, b));
                hashMap.put(r, points);
            } else {
                points.add(new Point(a,b));
            }
        }

        System.out.println(solve(new Point(x0, y0), new Point(x1, y1)));
    }

    public static int solve(Point start, Point goal) {
        Queue<State> queue = new ArrayDeque<>();
        queue.add(new State(new Point(start.x, start.y), 0));
        while (!queue.isEmpty()) {
            State currentState = queue.remove();
            if(visited.get(currentState.toString()) == null) {
                if(currentState.state.x == goal.x && currentState.state.y == goal.y) return currentState.moves;
                queue.addAll(getNextMoves(currentState));
                visited.put(currentState.toString(), false);
            }

        }
        return -1;
    }

    public static ArrayList<State> getNextMoves(State curr) {
        Point p = curr.state;
        ArrayList<State> moves = new ArrayList<>();
        if(withinBoard(p.x, p.y + 1) && isValidMove(p.x, p.y + 1)) moves.add(new State(new Point(p.x, p.y + 1), curr.moves + 1));
        if(withinBoard(p.x, p.y - 1) && isValidMove(p.x, p.y - 1)) moves.add(new State(new Point(p.x, p.y - 1), curr.moves + 1));
        if(withinBoard(p.x + 1, p.y) && isValidMove(p.x + 1, p.y)) moves.add(new State(new Point(p.x + 1, p.y), curr.moves + 1));
        if(withinBoard(p.x - 1, p.y) && isValidMove(p.x - 1, p.y)) moves.add(new State(new Point(p.x - 1, p.y), curr.moves + 1));
        if(withinBoard(p.x + 1, p.y + 1) && isValidMove(p.x + 1, p.y + 1)) moves.add(new State(new Point(p.x + 1, p.y + 1), curr.moves + 1));
        if(withinBoard(p.x - 1, p.y + 1) && isValidMove(p.x - 1, p.y + 1)) moves.add(new State(new Point(p.x - 1, p.y + 1), curr.moves + 1));
        if(withinBoard(p.x + 1, p.y - 1) && isValidMove(p.x + 1, p.y - 1)) moves.add(new State(new Point(p.x + 1, p.y - 1), curr.moves + 1));
        if(withinBoard(p.x - 1, p.y - 1) && isValidMove(p.x - 1, p.y - 1)) moves.add(new State(new Point(p.x - 1, p.y - 1), curr.moves + 1));
        return moves;
    }

    private static boolean isValidMove(int x, int y) {
        ArrayList<Point> segments = hashMap.get(x);
        if (segments == null) return false;
        for (Point p : segments) {
            if(withinSegment(y, p)) return true;
        }
        return false;
    }


    public static boolean withinSegment(int x, Point p1) {
        return x >= p1.x && x <= p1.y;
    }

    public static boolean withinBoard(int x, int y) {
        return (x >= 0 && x <= 1000000000) && (y >= 0 && y <= 1000000000);
    }

}

class State {
    Point state;
    int moves;

    public State(Point state, int moves) {
        this.state = state;
        this.moves = moves;
    }

    @Override
    public String toString() {
       return state.x + "" + state.y;
    }
}
