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

public class Main {

	private static class Block {
		int row, c1, c2;

		Block(int row, int c1, int c2) {
			this.row = row;
			this.c1 = c1;
			this.c2 = c2;
		}

		boolean contains(Point p) {
			return p.x == row && p.y >= c1 && p.y <= c2;
		}

		boolean overlaps(Block b) {
			return Math.abs(row - b.row) <= 1
					&& ((c1 >= b.c1 - 1 && c1 <= b.c2 + 1) || (c2 >= b.c1 - 1 && c2 <= b.c2 + 1)
							|| (b.c1 >= c1 - 1 && b.c1 <= c2 + 1) || (b.c2 >= c1 - 1 && b.c2 <= c2 + 1));
		}

	}

	private static class Point {
		int x, y;

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

//		public boolean equals(Point obj) {
//			return obj.x == x && obj.y == y;
//		}
	}

	private static Point start, end;
	private static Block[] blocks = new Block[100000];
	private static boolean[] vis = new boolean[100000];
	private static int blocksCount;
	private static int kingsLocation;

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		start = new Point(s.nextInt() - 1, s.nextInt() - 1);
		end = new Point(s.nextInt() - 1, s.nextInt() - 1);
		blocksCount = s.nextInt();
		for (int i = 0; i < blocksCount; i++) {
			blocks[i] = new Block(s.nextInt() - 1, s.nextInt() - 1, s.nextInt() - 1);
			if (blocks[i].contains(start)) {
				kingsLocation = i;
			}
		}
		vis[kingsLocation] = true;
		int result = dfs(kingsLocation, start.y);
		System.out.println(result != Integer.MAX_VALUE / 2 ? result : -1);
		vis[kingsLocation] = false;
	}

	private static int dfs(int currentBlock, int col) {
		if (!blocks[currentBlock].contains(new Point(blocks[currentBlock].row, col))) {
			return Integer.MAX_VALUE / 2;
		}
		if (blocks[currentBlock].contains(end)) {
			return Math.abs(col - end.y);
		}
		int dist = Integer.MAX_VALUE / 2;
		for (int i = 0; i < blocksCount; i++) {
			if (!vis[i]) {
				if (blocks[currentBlock].overlaps(blocks[i])) {
					vis[i] = true;
					dist = Math.min(dist, Math.min(Math.min(Math.abs(blocks[i].c1 - col) + dfs(i, blocks[i].c1),
							Math.abs(blocks[i].c2 - col) + dfs(i, blocks[i].c2)), dfs(i, col)));
					vis[i] = false;
				}
			}
		}
		return dist;
	}

}
