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.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class KingPath {
	public static void main(String[] args) throws NumberFormatException, IOException {
		Scanner sc = new Scanner(System.in);
		x0 = sc.nextInt();
		y0 = sc.nextInt();
		x1 = sc.nextInt();
		y1 = sc.nextInt();
		
		map = new TreeMap<Pair, Integer>();
		
		int nextNode = 0;
		int n = sc.nextInt();
		while(n-->0) {
			int r = sc.nextInt();
			int s = sc.nextInt();
			int e = sc.nextInt();
			for(int i = s; i <= e; i++) {
				Pair cell = new Pair(r, i);
				if(!map.containsKey(cell))
					map.put(cell, nextNode++);
			}
		}
		
		adjList = new ArrayList[nextNode];
		for(int i = 0; i < nextNode; i++)
			adjList[i] = new ArrayList<Integer>();
		
		int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
		int dy[] = {0, 0, 1, -1, 1, 1, -1, -1};
		for(Pair p : map.keySet()) {
			int curNode = map.get(p);
			for(int i = 0; i < 8; i++) {
				Pair adj = new Pair(p.x + dx[i], p.y + dy[i]);
				Integer adjNode = map.get(adj);
				if(adjNode != null) {
					adjList[curNode].add(adjNode);
				}
			}
		}
		int res = bfs();
		System.out.println(res == inf? -1 : res);
	}
	
	static int inf = (int) 1e7;
	static int bfs() {
		int[] dist = new int[map.size()];
		Pair start = new Pair(x0, y0);
		Pair end = new Pair(x1, y1);
		
		int sn = map.get(start), en = map.get(end);
		
		
		Arrays.fill(dist, inf);
		dist[sn] = 0;
		
		Queue<Integer> q = new LinkedList<Integer>();
		q.add(sn);
		while(!q.isEmpty()) {
			int u = q.remove();
			
			for(int v : adjList[u])
				if(dist[v] == inf) {
					dist[v] = 1 + dist[u];
					q.add(v);
				}
		}
		
		return dist[en];
	}
	
	static int x0, y0, x1, y1;
	static TreeMap<Pair, Integer> map;
	static ArrayList<Pair> unmap;
	static ArrayList<Integer>[] adjList;
	
	static class Pair implements Comparable<Pair>{
		int x, y;
		Pair(int a, int b) {
			x = a; y = b;
		}
		@Override
		public int compareTo(Pair p) {
			return x == p.x? y - p.y : x - p.x;
		}
		
		public String toString() {
			return String.format("(%d, %d)", x, y);
		}
	}
	
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner(FileReader f) {
			br = new BufferedReader(f);
		}

		public boolean ready() throws IOException {
			return br.ready();
		}

		Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		String nextLine() throws IOException {
			return br.readLine();
		}

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

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

}
