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.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class KingsPath {
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		int x0 = sc.nextInt();
		int y0 = sc.nextInt();
		int x1 = sc.nextInt();
		int y1 = sc.nextInt();

		TreeMap<Integer,TreeSet<Integer>> map = new TreeMap<>();
		int n = sc.nextInt();
		while(n-->0)
		{
			int row = sc.nextInt();
			int l = sc.nextInt();
			int r = sc.nextInt();
			if(!map.containsKey(row))
				map.put(row, new TreeSet<>());
			for(int i=l;i<=r;i++)
				map.get(row).add(i);
		}
//		System.out.println(map);
		int[] dx = {0, 0, 1, -1 ,1,1,-1,-1};
		int[] dy = {1, -1, 0, 0,-1,1,-1,1};
		TreeMap<Integer,TreeSet<Integer>> vis = new TreeMap<>();
		Queue<Pair> q = new LinkedList<>();
		q.add(new Pair(x0,y0,0));
		long ans = -1;
		while(!q.isEmpty())
		{
			Pair now = q.poll();
			if(now.x == x1 && now.y == y1)
			{
				ans = now.cost;
				break;
			}
			
			for(int i=0;i<8;i++)
			{
				int xx = now.x+dx[i];
				int yy = now.y+dy[i];
				if(map.get(xx) != null && map.get(xx).contains(yy) && (vis.get(xx) == null ||  !(vis.get(xx).contains(yy))))
				{
					if(vis.get(xx) == null)
						vis.put(xx , new TreeSet<>());
					vis.get(xx).add(yy);
					q.add(new Pair(xx,yy,now.cost+1));
				}
			}
		}
		System.out.println(ans);
		

	}
	
	
	static class Pair{
		int x,y;
		long cost;
		public Pair(int a , int b , long c){
			x = a;
			y = b;
			cost = c;
		}
		public String toString(){
			return x + " " + y + " " + cost;
		}
	}
	
	
	static class Scanner{
		StringTokenizer st;BufferedReader br;
		public Scanner(InputStream s){	br = new BufferedReader(new InputStreamReader(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 long nextLong() throws IOException {return Long.parseLong(next());}
		public String nextLine() throws IOException {return br.readLine();}
		public double nextDouble() throws IOException {return Double.parseDouble(next());}
		public boolean ready() throws IOException {return br.ready();}
	}

}
