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.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main implements Runnable {

	public static final int INF = Integer.MAX_VALUE / 2;

	class cell {

		int x;
		int y;

		public cell(int x, int y) {
			super();
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			cell other = (cell) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x != other.x)
				return false;
			if (y != other.y)
				return false;
			return true;
		}

		private Main getOuterType() {
			return Main.this;
		}

	}

	private void solve() throws IOException {
		int x0 = nextInt();
		int y0 = nextInt();
		int x1 = nextInt();
		int y1 = nextInt();
		int n = nextInt();
		HashSet<cell> map1 = new HashSet<cell>();
		HashMap<cell, Integer> map2 = new HashMap<cell, Integer>();
		for (int i = 0; i < n; ++i) {
			int r = nextInt();
			int a = nextInt();
			int b = nextInt();
			for (int k = a; k <= b; ++k) {
				map1.add(new cell(r, k));
			}
		}
		// for(cell c: map1){
		// out.println( c.x +" , " +c.y );
		// }
		Queue<cell> q = new ArrayDeque<cell>();
		cell first = new cell(x0, y0);
		q.add(first);
		map2.put(new cell(x0, y0), 0);
		while (!q.isEmpty()) {
			cell c = q.remove();
//			out.println("saque " + c.x + " , " + c.y);
			int v = map2.get(c) + 1;
			if (map1.contains(new cell(c.x + 1, c.y))) {
				if (!map2.containsKey(new cell(c.x + 1, c.y))) {
					map2.put(new cell(c.x + 1, c.y), v);
					q.add(new cell(c.x + 1, c.y));
				}
			}
			if (map1.contains(new cell(c.x - 1, c.y))) {
				if (!map2.containsKey(new cell(c.x - 1, c.y))) {
					map2.put(new cell(c.x - 1, c.y), v);
					q.add(new cell(c.x - 1, c.y));
				}
			}
			if (map1.contains(new cell(c.x, c.y + 1))) {
				if (!map2.containsKey(new cell(c.x, c.y + 1))) {
					map2.put(new cell(c.x, c.y + 1), v);
					q.add(new cell(c.x, c.y + 1));
				}
			}
			if (map1.contains(new cell(c.x, c.y - 1))) {
				if (!map2.containsKey(new cell(c.x, c.y - 1))) {
					map2.put(new cell(c.x, c.y - 1), v);
					q.add(new cell(c.x, c.y - 1));
				}
			}
			// -
			if (map1.contains(new cell(c.x + 1, c.y + 1))) {
				if (!map2.containsKey(new cell(c.x + 1, c.y + 1))) {
					map2.put(new cell(c.x + 1, c.y + 1), v);
					q.add(new cell(c.x + 1, c.y + 1));
				}
			}
			if (map1.contains(new cell(c.x - 1, c.y - 1))) {
				if (!map2.containsKey(new cell(c.x - 1, c.y - 1))) {
					map2.put(new cell(c.x - 1, c.y - 1), v);
					q.add(new cell(c.x - 1, c.y - 1));
				}
			}
			if (map1.contains(new cell(c.x - 1, c.y + 1))) {
				if (!map2.containsKey(new cell(c.x - 1, c.y + 1))) {
					map2.put(new cell(c.x - 1, c.y + 1), v);
					q.add(new cell(c.x - 1, c.y + 1));
				}
			}
			if (map1.contains(new cell(c.x + 1, c.y - 1))) {
				if (!map2.containsKey(new cell(c.x + 1, c.y - 1))) {
					map2.put(new cell(c.x + 1, c.y - 1), v);
					q.add(new cell(c.x + 1, c.y - 1));
				}
			}
		}

		if (map2.containsKey(new cell(x1, y1))) {
			out.println(map2.get(new cell(x1, y1)));
		} else {
			out.println(-1);
		}
	}

	private BufferedReader in;
	private PrintWriter out;
	private StringTokenizer st;
	private String FNAME = "";

	private void eat(String s) {
		st = new StringTokenizer(s);
	}

	String next() throws IOException {
		while (!st.hasMoreTokens()) {
			String line = in.readLine();
			if (line == null) {
				return null;
			}
			eat(line);
		}
		return st.nextToken();
	}

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

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

	double nextDouble() throws IOException {
		return Double.parseDouble(next());
	}

	public static void main(String[] args) throws IOException {
		new Thread(null, new Main(), "Main", 1 << 25).start();
	}

	@Override
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(new OutputStreamWriter(System.out));
			// in = new BufferedReader(new FileReader(FNAME + ".in"));
			// out = new PrintWriter(new FileWriter(FNAME + ".out"));
			eat("");
			solve();
			in.close();
			out.close();
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(586);
		}
	}

}
