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.ArrayDeque;
import java.util.Arrays;
import java.util.HashMap;
import java.util.StringTokenizer;

public class Solution {

	public class Point {
		long x, y;
		int num;
		
		public Point(long x, long y, int num) {
			this.x = x;
			this.y = y;
			this.num = num;
		}
	}

	long inf = 1000000000;
	long[] d = new long[100010];
	HashMap<Long, Point> hm = new HashMap<Long, Point>(200000);

	long key(long px, long py) {
		return (inf * (px - 1) + (py - 1));
	}
	
	void bfs(Point st) {
		ArrayDeque<Point> q = new ArrayDeque<Solution.Point>();
		q.addLast(st);
		d[st.num] = 0;
		long[] masx = {-1, -1, 0, 1, 1, 1, 0, -1}, masy = {0, 1, 1, 1, 0, -1, -1, -1};
		while (!q.isEmpty()) {
			Point from = q.pollFirst();
			for (int i = 0; i < 8; ++i) {
				long k = key(from.x + masx[i], from.y + masy[i]);
				if (hm.containsKey(k) && d[hm.get(k).num] == inf) {
					q.addLast(hm.get(k));
					d[hm.get(k).num] = d[from.num] + 1;
				}
			}
		}
	}

	void solve() throws IOException {
		int col = 0, distTo = 0;
		Point st = new Point (nextLong(), nextLong(), col++), 
				fin = new Point (nextLong(), nextLong(), 0);
		
		hm.put(key(st.x, st.y), st);
		if (!hm.containsKey(key(fin.x, fin.y))) {
			fin.num = col++;
			hm.put(key(fin.x, fin.y), fin);
			distTo = 1;
		}
		
		int n = nextInt();
		for (int i = 0; i < n; ++i) {
			long r = nextLong(), a = nextLong(), b = nextLong();
			for (long j = a; j <= b; ++j) {
				if (!hm.containsKey(key(r, j))) {
					hm.put(key(r, j), new Point(r, j, col++));
				}
			}
		}
		
		Arrays.fill(d, inf);
		bfs(st);
		
		if (d[distTo] == inf) {
			System.out.println(-1);
		} else {
			System.out.println(d[distTo]);
		}
	}

	BufferedReader br;
	StringTokenizer st;

	String next() throws IOException {
		while (st == null || !st.hasMoreTokens()) {
			String s = br.readLine();
			if (s == null) {
				return "-1";
			}
			st = new StringTokenizer(s);
		}
		return st.nextToken();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(next());

	}

	long nextLong() throws IOException {
		return Long.parseLong(next());
	}

	void run() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		// out = new PrintWriter("path.out");
		solve();
		br.close();
		// out.close();
	}

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

}
