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.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {
	static int x0 , y0 , x1 , y1 , n , size;
	static int[] dx = {0,1,1,1,0,-1,-1,-1};
	static int[] dy = {1,1,0,-1,-1,-1,0,1};
	static HashMap<Integer,HashSet<Integer>> nodes;
	
	static int bfs()
	{
		HashMap<Integer, Integer> xToIdx = new HashMap<Integer, Integer>();
		
		int idx = 1;
		
		HashMap<Integer, Integer>[] dist = new HashMap[size];
		for (int i = 0; i < dist.length; i++) 
		{
			dist[i] = new HashMap<Integer, Integer>();
			
		}
		
		xToIdx.put(x0, 0);	
		
		
		dist[0].put(y0, 0);
		
		Queue<Pair> q = new LinkedList<Pair>();
		q.add(new Pair(x0,y0));
		
		while(!q.isEmpty())
		{
			Pair cur = q.poll();
			int x = cur.x , y = cur.y;
			int nd = dist[xToIdx.get(x)].get(y) + 1;
			for (int i = 0; i < dx.length; i++) 
			{
				int nx = x+dx[i] , ny = y + dy[i];
				if(!available(nx, ny))continue;


				if(xToIdx.containsKey(nx))
				{
					int ind = xToIdx.get(nx);
					if(dist[ind].containsKey(ny))
					{
						int d = dist[ind].get(ny);
						if(nd<d)
						{
							dist[ind].put(ny, nd);
							q.add(new Pair(nx,ny));
						}
					}
					else
					{
						dist[ind].put(ny, nd);
						q.add(new Pair(nx,ny));
					}
				}
				else
				{
					xToIdx.put(nx, idx);
					
					dist[idx++].put(ny, nd);
					q.add(new Pair(nx,ny));
				}
			}
		}
		if(!xToIdx.containsKey(x1))
			return -1;
		return dist[xToIdx.get(x1)].get(y1);
	}
	
	static boolean available(int x,int y){return nodes.containsKey(x) && nodes.get(x).contains(y);}
	
	static class Pair {
		int x,y;
		public Pair(int a ,int b) {x = a; y = b;}
	}
	
	public static void main(String[] args) throws IOException 
	{
		Scanner sc = new Scanner((System.in));
		x0 = sc.nextInt();
		y0 = sc.nextInt();
		x1 = sc.nextInt(); 
		y1 = sc.nextInt();
		
		n = sc.nextInt();
		
		nodes = new HashMap<Integer, HashSet<Integer>>();
		size = 0;
		
		for (int i = 0; i < n; i++) 
		{
			int r = sc.nextInt() , a = sc.nextInt() , b = sc.nextInt();
			if(!nodes.containsKey(r))
				nodes.put(r, new HashSet<Integer>());			
			for(int j = a; j <=b;j++)
			{
				if(!nodes.get(r).contains(j))
					size++;
				nodes.get(r).add(j);
			}
		}
		
		System.out.println(bfs());
	}
	
	
	
	static class Scanner 
	{
		StringTokenizer st;
		BufferedReader br;
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(s));}
		public Scanner(String s) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(s));
		}
		public String next() throws IOException 
		{
			while (st == null || !st.hasMoreTokens()) 
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException {return Integer.parseInt(next());}
		public String nextLine() throws IOException {return br.readLine();}		
		public long nextLong() throws IOException {return Long.parseLong(next());}		
		public double nextDouble() throws IOException {return Double.parseDouble(next());}	
		public boolean ready() throws IOException {return br.ready();}
	}

}