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.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class KingsPath {
	static class P implements Comparable<P> {
		int x, y, c;

		public P(int xx, int yy) {
			x = xx;
			y = yy;
		}

		public P(int xx, int yy, int cc) {
			x = xx;
			y = yy;
			c = cc;
		}

		@Override
		public int compareTo(KingsPath.P o) {
			if (x == o.x)
				return y - o.y;
			return x - o.x;
		}

	}

	public static void main(String[] args) throws IOException {
		InputReader r = new InputReader(System.in);
		int x0 = r.nextInt();
		int y0 = r.nextInt();
		int x1 = r.nextInt();
		int y1 = r.nextInt();
		int n = r.nextInt();
		TreeSet<P> set = new TreeSet<P>();
		for (int i = 0; i < n; i++) {
			int row = r.nextInt();
			int a = r.nextInt();
			int b = r.nextInt();
			for (int j = a; j <= b; j++) {
				set.add(new P(row, j));
				P p = new P(row,j);
			}
		}
		TreeSet<P> visited = new TreeSet<P>();
		LinkedList<P> q = new LinkedList<P>();
		q.add(new P(x0, y0, 0));
		visited.add(new P(x0, y0, 0));
		int[] dx = { -1, -1, -1, 0, 0, 1, 1, 1 };
		int[] dy = { -1, 0, 1, -1, 1, 1, 0, -1 };
		while (!q.isEmpty()) {
			P front = q.remove();
			if (front.x == x1 && front.y == y1) {
				System.out.println(front.c);
				return;
			}
			for (int k = 0; k < dx.length; k++) {
				int nx = front.x + dx[k];
				int ny = front.y + dy[k];
				P p = new P(nx, ny);
				
				if (visited.contains(p) || !set.contains(p))
					continue;
				visited.add(new P(nx,ny));
				p.c = front.c + 1;
				q.add(p);
			}
		}
		System.out.println(-1);
	}

	static class InputReader {
		private BufferedReader reader;
		private StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream));
			tokenizer = null;
		}

		public InputReader(FileReader stream) {
			reader = new BufferedReader(stream);
			tokenizer = null;
		}

		public String nextLine() {
			try {
				return reader.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
				return null;
			}
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

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