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.io.PrintWriter;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;

public class King_s_Path_CF149_Div2 {
	static Scanner sc;
	static PrintWriter out;
	// in a Grid I want to move from point to a point in shortest path and only specific cells are allowed
	// I will save the allowed cells
	static TreeSet<Pair> allowed;
	static TreeMap<Pair,Integer> len;
	static Queue<Pair> q;
	
	public static void main(String[] args) throws Exception{
		sc =new Scanner(System.in);
		
		allowed = new TreeSet<Pair>();
		len = new TreeMap<Pair,Integer>();
		q = new LinkedList<Pair>();
		int x1=sc.nextInt(),y1=sc.nextInt(),x2=sc.nextInt(),y2=sc.nextInt();
		int segs = sc.nextInt();
		while(segs-->0)
		{
			int r=sc.nextInt(),a=sc.nextInt(),b=sc.nextInt();
			for(int i=a;i<=b;i++)
				allowed.add(new Pair(r,i));
		}
		
		Pair start = new Pair(x1,y1);
		Pair end = new Pair(x2,y2);
		len.put(start, 0);
		q.add(start);
				//n, ne, e, se, s, sw, w, nw
		int[] dx = {-1,-1,0,1,1,1,0,-1};
		int[] dy = {0,1,1,1,0,-1,-1,-1};
		
		while(!q.isEmpty())
		{
			Pair u = q.poll();
			int x =u.x,y =u.y;
			
			for(int i=0;i<8;i++)
			{
				int nx = x+dx[i],ny = y+dy[i];
				Pair v = new Pair(nx,ny);
				
				if(!allowed.contains(v) || /*visited*/ len.containsKey(v))
					continue;
				
				if(v.compareTo(end)==0)
				{
					System.out.println(len.get(u)+1);
					return;
				}
				
				q.add(v);
				len.put(v, len.get(u)+1);
			}
		}
		System.out.println(-1);
	}
	
	static class Pair implements Comparable<Pair>{

		int x,y;
		public Pair(int a,int b) {
			x=a;y=b;
		}
		@Override
		public int compareTo(Pair o) {
			if(this.x==o.x)
				return this.y-o.y;
			return this.x-o.x;
		}
		
		
	}
	static class Scanner{
		StringTokenizer st;
		BufferedReader br;
		public Scanner(InputStream system) {
			br = new BufferedReader(new InputStreamReader(system));
		}
		public Scanner(FileReader file) {
			br = new BufferedReader(file);
		}
		public String next() throws IOException {
			while(st == null || !st.hasMoreTokens())
			{
				st = new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}
		public String nextLine() throws IOException {
			return br.readLine();
		}
		public int nextInt()throws IOException{
			return Integer.parseInt(next());
		}
		public double nextDouble()throws IOException{
			return Double.parseDouble(next());
		}
		public char nextChar()throws IOException{
			return next().charAt(0);
		}
		public long nextLong()throws IOException{
			return Long.parseLong(next());
		}
		public boolean ready() throws IOException {
			return br.ready();
		}
		public void waitForInput() throws InterruptedException {
			Thread.sleep(5000);
		}
	}
}
