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

public class Main {
	
	Scanner in;
	static PrintWriter out;
	
	
	
	
	static class Scanner {
		StreamTokenizer in;
		
		Scanner(InputStream is) {
			in = new StreamTokenizer(new BufferedReader(new InputStreamReader(is)));
		}
		
		int nextInt() {
			try {
				in.nextToken();
				return (int)in.nval;
			} catch (IOException e) {
				throw new Error();
			}
		}
	}
	
	
	static class Point implements Comparable <Point> {
		int x;
		int y;
		
		Point(int x, int y) {
			this.x = x;
			this.y = y;
		}
		
		public int compareTo(Point second) {
			if (this.x != second.x) {
				return this.x - second.x;
			} else {
				return this.y - second.y;
			}
		}
	}
	
	static class Line implements Comparable <Line> {
		int row;
		int lo;
		int hi;
		
		Line(Scanner in) {
			row = in.nextInt();
			lo = in.nextInt();
			hi = in.nextInt();
		}
		
		public int compareTo(Line second) {
			if (this.row != second.row) {
				return this.row - second.row;
			} else {
				if (this.lo != second.lo) {
					return this.lo - second.lo;
				}
				return this.hi - second.hi;
			}
		}
	}
	
	TreeMap <Point, Integer> points = new TreeMap<Main.Point, Integer>();
	

	void solve() {
		int xFrom = in.nextInt();
		int yFrom = in.nextInt();
		int xTo = in.nextInt();
		int yTo = in.nextInt();
		
		int n = in.nextInt();
		Line []lines = new Line[n];
		int sumLen = 0;
		for (int i = 0; i < lines.length; i++) {
			lines[i] = new Line(in);
			sumLen += lines[i].hi - lines[i].lo + 1;
			
		}
		asserT(sumLen <= 100000);
		for (int i = 0; i < lines.length; i++) {
			for (int p = lines[i].lo; p <= lines[i].hi; p++) {
				points.put(new Point(lines[i].row, p), 10000000);
			}
		}
		
		Queue <Point> q = new LinkedList <Point>();
		q.add(new Point(xFrom, yFrom));
		Point always = new Point(0, 0);
		points.put(new Point(xFrom, yFrom), 0);
		while (!q.isEmpty()) {
			Point curr = q.poll();
			int dist = points.get(curr);
			if (curr.x == xTo && curr.y == yTo) {
				out.println(dist);
				return;
			}
			
			for (int dy = -1; dy <= 1; dy++) {
				for (int dx = -1; dx <= 1; dx++) {
					if (dx == 0 && dy == 0) {
						continue;
					}
					always.x = curr.x + dx;
					always.y = curr.y + dy;
					
					Integer dst = points.get(always);
					if (dst != null) {
						if (dst > dist + 1) {
							Point np = new Point(always.x, always.y);
							points.put(np, dist + 1);
							q.add(np);
						}
					}
				}
			}
		}
		out.println(-1);
	}
	
	static void asserT(boolean e) {
		if (!e) {
			throw new Error();
		}
	}
	
	
	public void run() {
		in = new Scanner(System.in);
		out = new PrintWriter(System.out);
		
		try {
			solve();
		} finally {
			out.close();
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}

} 