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.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class Main {
	public static final int MAX = (int) (1e9);
	public static int sr, sc, er, ec, N;
	public static HashMap<Integer, ArrayList<segment>> map = new HashMap<Integer, ArrayList<segment>>();
	public static final int[] dr = new int[] { -1, 0, 1, -1, 1, -1, 0, 1 };
	public static final int[] dc = new int[] { -1, -1, -1, 0, 0, 1, 1, 1 };

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(f.readLine());
		sr = Integer.parseInt(st.nextToken());
		sc = Integer.parseInt(st.nextToken());
		er = Integer.parseInt(st.nextToken());
		ec = Integer.parseInt(st.nextToken());
		N = Integer.parseInt(f.readLine());
		for (; N > 0; N--) {
			st = new StringTokenizer(f.readLine());
			int row = Integer.parseInt(st.nextToken());
			int l = Integer.parseInt(st.nextToken());
			int r = Integer.parseInt(st.nextToken());
			if (!map.containsKey(row)) {
				map.put(row, new ArrayList<segment>());
			}
			map.get(row).add(new segment(l, r));
		}
		System.out.println(bfs());
	}

	public static int bfs() {
		int curr = 0;
		ArrayDeque<node> queue = new ArrayDeque<node>();
		HashSet<node> set = new HashSet<node>();
		queue.offer(new node(sr, sc));
		set.add(new node(sr, sc));
		while (!queue.isEmpty()) {
			ArrayDeque<node> temp = new ArrayDeque<node>();
			while (!queue.isEmpty()) {
				node n = queue.poll();
				if (n.r == er && n.c == ec) {
					return curr;
				}
				for (int d = 0; d < 8; d++) {
					int nextR = n.r + dr[d];
					int nextC = n.c + dc[d];
					if (!valid(nextR, nextC) || !allowed(nextR, nextC) || set.contains(new node(nextR, nextC)))
						continue;
					set.add(new node(nextR, nextC));
					temp.offer(new node(nextR, nextC));
				}
			}
			curr++;
			queue.addAll(temp);
		}
		return -1;
	}

	public static boolean allowed(int r, int c) {
		if (!map.containsKey(r)) {
			return false;
		}
		for (segment s : map.get(r)) {
			if (s.l <= c && s.r >= c) {
				return true;
			}
		}
		return false;
	}

	public static boolean valid(int r, int c) {
		return r >= 1 && r <= MAX && c >= 1 && c <= MAX;
	}
}

class segment {
	public int l, r;

	public segment(int a, int b) {
		l = Math.min(a, b);
		r = Math.max(a, b);
	}
}

class node {
	public int r, c;

	public node(int a, int b) {
		r = a;
		c = b;
	}

	@Override
	public int hashCode() {
		final int prime = 31;
		int result = 1;
		result = prime * result + c;
		result = prime * result + r;
		return result;
	}

	@Override
	public boolean equals(Object obj) {
		if (this == obj)
			return true;
		if (obj == null)
			return false;
		if (getClass() != obj.getClass())
			return false;
		node other = (node) obj;
		if (c != other.c)
			return false;
		if (r != other.r)
			return false;
		return true;
	}

}