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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Collection;
import java.util.HashMap;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.util.Queue;
import java.util.LinkedList;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main (String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader (inputStream);
		PrintWriter out = new PrintWriter (outputStream);
		TaskC solver = new TaskC ();
		solver.solve (1, in, out);
		out.close ();
	}
	
	static class TaskC {
		private static final byte[] dx = {-1, -1, -1, 0, 0, 1, 1, 1};
		private static final byte[] dy = {0, -1, 1, -1, 1, 0, -1, 1};
		private static HashMap<Long, Boolean> allowed = new HashMap<Long, Boolean> ();
		private static HashMap<Long, Integer> dist = new HashMap<Long, Integer> ();
		private static int xf;
		private static int yf;
		
		private static long map (int x, int y) {
			return y|(((long) x)<<32)/*1000000005L*x + y*/;
		}
		
		private static void bfs (int x, int y) {
			dist.put (map (x, y), 0);
			Queue<Long> q = new LinkedList<Long> ();
			q.add (map (x, y));
			while (!q.isEmpty ()) {
				long op = q.poll ();
				int x1 = (int) (op>>32)/*(op/1000000005)*/;
				int y1 = (int) (op)/*(op%1000000005)*//*op-x1*1000000005*/;
				if (x1 == xf && y1 == yf) return;
				for (int i = 0; i<8; i++) {
					int newX = x1+dx[i];
					int newY = y1+dy[i];
					if (allowed.get (map (newX, newY)) != null) {
						if (dist.get (map (newX, newY)) == null) {
							q.add (map (newX, newY));
							dist.put (map (newX, newY), dist.get (map (x1, y1))+1);
						}
					}
				}
			}
		}
		
		public void solve (int testNumber, InputReader in, PrintWriter out) {
/* worst complexity can be o(n).Have to find shortest path but with a twist: allowed cell marking
 * seems to eat at least o(n), I can't find any other way. Have to use map to search in o(1)*/
			int x0 = in.nextInt (), y0 = in.nextInt (), x1 = in.nextInt (), y1 = in.nextInt ();
			int n = in.nextInt ();
			int idx = 0;
			for (int i = 0; i<n; i++) {
				int r = in.nextInt ();
				int a = in.nextInt ();
				int b = in.nextInt ();
				for (int j = a; j<=b; j++) {
					allowed.put (map (r, j), true);
				}
			}
			xf = x1;
			yf = y1;
			bfs (x0, y0);
			int ans = dist.get (map (x1, y1)) != null ? dist.get (map (x1, y1)) : -1;
			out.println (ans);
		
		/*//testing get
		long op = map (1, 1);
		int x = (int) (op>>32)*//*(op/1000000005)*//*;
		int y = (int) (op)*//*(op%1000000005)*//*;
		System.out.println (x+" "+y);*/
		}
		
	}
	
	static class InputReader {
		private BufferedReader reader;
		private StringTokenizer tokenizer;
		
		public InputReader (InputStream stream) {
			reader = new BufferedReader (new InputStreamReader (stream), 32768);
			tokenizer = null;
		}
		
		public String next () {
			while (tokenizer == null || !tokenizer.hasMoreTokens ()) {
				try {
					String str;
					if ((str = reader.readLine ()) != null) tokenizer = new StringTokenizer (str);
					else return null;//to detect eof
				} catch (IOException e) {
					throw new RuntimeException (e);
				}
			}
			return tokenizer.nextToken ();
		}
		
		public int nextInt () {
			return Integer.parseInt (next ());
		}
		
	}
}

