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.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.HashMap;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class C {

	static class N {
		int r, a, b;
		public N(int c, int d, int e){
			r = c;
			a = d;
			b = e;
		}
	}

	public static void main(String[] args) throws Exception {
		FastScanner scan = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int x0 = scan.nextInt(), y0 = scan.nextInt(), xx = scan.nextInt(), yy = scan.nextInt();
		int n = scan.nextInt();
		HashMap<Integer, String> map = new HashMap<>();
		TreeSet<String> v = new TreeSet<>();
		for(int i = 0; i < n; i++){
			int r = scan.nextInt(), a = scan.nextInt(), b = scan.nextInt();
			if(!map.containsKey(r)) map.put(r, a+" "+b);
			else{
				String[] split = map.get(r).split(" ");
				int aa = Integer.parseInt(split[0]), bb = Integer.parseInt(split[1]);
				aa = Math.min(aa, a);
				bb = Math.max(bb, b);
				map.put(r, aa+" "+bb);
			}
		}
		ArrayDeque<Integer> q = new ArrayDeque<Integer>();
		int[] d =  {1, -1, 0, 0, -1, 1, -1, 1};
		int[] dd = {0, 0, 1, -1, 1, 1, -1, -1};
		q.add(x0); q.add(y0); q.add(0);
		v.add(x0+" "+y0);
		while(!q.isEmpty()){
			int x = q.poll(), y = q.poll(), t = q.poll();
			//			System.out.println(x+" "+y);
			if(x == xx && y == yy){
				out.println(t);
				out.close();
				return;
			}
			for(int i = 0; i < 8; i++){
				int dx = x+d[i], dy = y+dd[i];
				if(map.containsKey(dx)){
					String[] split = map.get(dx).split(" ");
					int a = Integer.parseInt(split[0]), b = Integer.parseInt(split[1]);
					if(dy >= a && dy <= b && !v.contains(dx+" "+dy)){	
						//						System.out.println("Passed");
						q.add(dx); q.add(dy); q.add(t+1);
						v.add(dx+" "+dy);
					}
				}
			}
		}
		out.println(-1);
		out.close();
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			try	{
				br = new BufferedReader(new InputStreamReader(System.in));
				st = new StringTokenizer(br.readLine());
			} catch (Exception e){e.printStackTrace();}
		}

		public String next() {
			if (st.hasMoreTokens())	return st.nextToken();
			try {st = new StringTokenizer(br.readLine());}
			catch (Exception e) {e.printStackTrace();}
			return st.nextToken();
		}

		public int nextInt() {return Integer.parseInt(next());}

		public long nextLong() {return Long.parseLong(next());}

		public double nextDouble() {return Double.parseDouble(next());}

		public String nextLine() {
			String line = "";
			try {line = br.readLine();} 
			catch (Exception e) {e.printStackTrace();}
			return line;
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for(int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n){
			long[] a = new long[n];
			for(int i = 0; i < n; i++) a[i] = nextLong();
			return a;
		}

		public double[] nextDoubleArray(int n){
			double[] a = new double[n];
			for(int i = 0; i < n; i++) a[i] = nextDouble();
			return a;
		}

		public char[][] nextGrid(int n, int m){
			char[][] grid = new char[n][m];
			for(int i = 0; i < n; i++) grid[i] = next().toCharArray();
			return grid;
		}
	}

}
