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.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;

public class Task {
	void run() {
		Scanner in = new Scanner(System.in);
		PrintWriter out = new PrintWriter(System.out);
		int x0 = in.nextInt();
		int y0 = in.nextInt();
		int x1 = in.nextInt();
		int y1 = in.nextInt();
		int n = in.nextInt();
		int[] r = new int[n];
		int[] a = new int[n];
		int[] b = new int[n];
		for (int i = 0; i < n; i++) {
			r[i] = in.nextInt();
			a[i] = in.nextInt();
			b[i] = in.nextInt();
		}
		int moves = findShortestPath(n, r, a, b, x0, y0, x1, y1);
		out.println(moves);
		out.close();
		in.close();
	}
	
	class Point {
		int x;
		int y;

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

		@Override
		public int hashCode() {
			return x * 15013 + y;
		}

		@Override
		public boolean equals(Object o) {
			if (o == null) {
				return false;
			}
			Point p = (Point) o;
			if (p == null) {
				return false;
			}
			return p.x == x && p.y == y;
		}
	}

	static int[][] directions = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}, {1, 1}, {-1, -1}, {-1, 1}, {1, -1}};

	class PathPoint {

		Point point;
		int distance;

		PathPoint(Point point, int distance) {
			this.point = point;
			this.distance = distance;
		}
	}

	int findShortestPath(int n, int[] r, int[] a, int[] b, int x0, int y0, int x1, int y1) {
		Map<Point, Boolean> points = new HashMap<>();
		Point p0 = new Point(x0, y0);
		Point p1 = new Point(x1, y1);
		points.put(p0, false);
		points.put(p1, false);
		for (int i = 0; i < n; i++) {
			for (int y = a[i]; y <= b[i]; y++) {
				Point p = new Point(r[i], y);
				points.put(p, false);
			}
		}
		Queue<PathPoint> q = new LinkedList<>();
		q.add(new PathPoint(p0, 0));
		points.put(p0, true);
		boolean found = false;
		int distance = -1;
		while (!q.isEmpty()) {
			PathPoint p = q.poll();
			for (int[] d : directions) {
				Point p2 = new Point(p.point.x + d[0], p.point.y + d[1]);
				Boolean visited = points.get(p2);
				if (visited != null && visited.equals(false)) {
					if (p2.equals(p1)) {
						found = true;
						distance = p.distance + 1;
						break;
					}
					q.add(new PathPoint(p2, p.distance + 1));
					points.put(p2, true);
				}
			}
			if (found) {
				break;
			}
		}
		return distance;
	}

	
	public static void main(String[] args) {
		new Task().run();
	}
}
