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

//package Round_149;

import java.util.*;
import java.io.*;

public class c {

	String input = "";
	String output = "";

	FastScanner in;
	PrintWriter out;

	class pair implements Comparable<pair>{
		
		int r, a, b;

		pair(int r, int a, int b){
			this.r = r;
			this.a = a;
			this.b = b;
		}
		
		@Override
		public int compareTo(pair o) {
			if (this.r == o.r){
				if (this.a == o.a)
					return this.b - o.b;
				else
					return this.a - o.a;
			}
			return this.r - o.r;
		}
		
	}
	
	int x1, y1;
	pair p[];
	int min = Integer.MAX_VALUE;
	boolean ok = false;
	
	boolean isFalse(int x, int y){
		int l = 0; int r = p.length -1 ;
		while (l < r){
			int mid = (l + r)/2;
			if (p[mid].r == x) { r = mid; break;}
			if (p[mid].r > x){
				r = mid - 1;
			}else 
				l = mid + 1;
		}
		
		if (p[r].r != x)
			return false;
		
		int d = 0;
		
		if (p[r].a > y)
			d = -1;
		else 
			d = 1;
		
		int i = r;
		while (i >=0 && p[i].r == x) {
			if (p[i].a <= y && y <= p[i].b)
				return true;
			if (p[i].a >= y)
				break;
			i--;
		}
		i = r;
		while (i < p.length && p[i].r == x){
			if (p[i].a <= y && y <= p[i].b)
				return true;
			if (p[i].b < y)
				break;
			i++;
		}
		return false;
	}
	
	HashMap<Integer, HashSet<Integer>> hash = new HashMap<Integer, HashSet<Integer>>();
	
	void dfs(int x, int y, int len){
		if (len > min) return;
		if (x <= 0 || y <= 0 || x > (int)1e9 || y > (int)1e9) return;
		if (x == x1 && y == y1){
			min = Math.min(min, len);
			ok  = true;
			return;
		}
		if (hash.containsKey(x)){
			if (hash.get(x).contains(y))
				return;
			else {
				hash.get(x).add(y);
			}
		}else {
			HashSet<Integer> h = new HashSet<Integer>();
			h.add(y);
			hash.put(x, h);
		}
		if (!isFalse(x, y)) return;
		dfs(x+1, y, len+1);
		dfs(x-1, y, len+1);
		dfs(x, y+1, len+1);
		dfs(x, y-1, len+1);
		dfs(x+1, y+1, len+1);
		dfs(x-1, y+1, len+1);
		dfs(x+1, y-1, len+1);
		dfs(x-1, y-1, len+1);
		
		hash.get(x).remove(y);
	}
	
	
	void solve() throws Exception {
		int x0 = in.nextInt();
		int y0 = in.nextInt();
		x1 = in.nextInt();
		y1 = in.nextInt();
		int n = in.nextInt();
		p = new pair[n];
		for (int i = 0; i<n; i++){
			p[i] = new pair(in.nextInt(), in.nextInt(), in.nextInt());
		}
		
		Arrays.sort(p);
		
		dfs(x0, y0, 0);
		
		if (!ok)
			out.println(-1);
		else out.println(min);
	}

	void run() {
		try {
			if (input.length() == 0) {
				InputStreamReader ins = new InputStreamReader(System.in);
				in = new FastScanner(new BufferedReader(ins));
			} else {
				FileReader f = new FileReader(input);
				in = new FastScanner(new BufferedReader(f));
			}
			if (output.length() == 0) {
				out = new PrintWriter(System.out);
			} else
				out = new PrintWriter(new File(output));

			solve();

			out.flush();
			out.close();
		} catch (Exception ex) {
			ex.printStackTrace();
			out.close();
		}
	}

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

	class FastScanner {
		BufferedReader bf;
		StringTokenizer st;

		FastScanner(BufferedReader bf) {
			this.bf = bf;
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(bf.readLine());

			return st.nextToken();
		}

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

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

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

	}

}
