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

public class Solution {
    
    public static FastScanner scn = new FastScanner();
 
	public static void main(String[] args) {

        int[] start = new int[]{scn.nextInt(), scn.nextInt()};
        int[] finish = new int[]{scn.nextInt(), scn.nextInt()};
        
        int n = scn.nextInt();
        
        Set<String> set = new HashSet<>();
        
        while(n-->0){
            int r = scn.nextInt();
            int a = scn.nextInt();
            int b = scn.nextInt();
            
            for(int idx = a; idx <= b; idx++)
                set.add(r + "-" + idx);
        }
        
        int distance = bfs(start, finish, set);
        
        System.out.println(distance);
	}
	
	public static int bfs(int[] start, int[] finish, Set<String> set){
	    
	    Set<String> visited = new HashSet<>();
	    
        Queue<int[]> queue = new LinkedList<>();
        queue.add(start);
        
        int distance = 0;
        
        while(!queue.isEmpty()){
            
            int size = queue.size();
            
            while(size-->0){
            
                int[] point = queue.remove();
                visited.add(toString(point));
                
                if(isEqual(point, finish)) return distance;
                
                for(int[] neighbor : getNeighbors(point)){
                    if(!visited.contains(toString(neighbor)) && set.contains(toString(neighbor))){
                        queue.add(neighbor);
                        visited.add(toString(neighbor));
                    }
                }
            }
            
            distance++;
        }
        
        return -1;
	}
	
	public static String toString(int[] arr){
	    return arr[0]+"-"+arr[1];
	}
	
	public static boolean isEqual(int[] p1, int[] p2){
	    return p1[0] == p2[0] && p1[1] == p2[1]; 
	}
	
	public static List<int[]> getNeighbors(int[] point){
	    
	    List<int[]> list = new ArrayList<>();
	    
	    list.add(new int[]{point[0]-1, point[1]-1});
	    list.add(new int[]{point[0]-1, point[1]});
	    list.add(new int[]{point[0]+1, point[1]+1});
	    
	    list.add(new int[]{point[0]  , point[1]-1});
	    list.add(new int[]{point[0]  , point[1]+1});
	    
	    list.add(new int[]{point[0]+1, point[1]-1});
	    list.add(new int[]{point[0]+1, point[1]});
	    list.add(new int[]{point[0]+1, point[1]+1});
	    
	    return list;
	}
	
	static class FastScanner {
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st=new StringTokenizer("");
		String next() {
			while (!st.hasMoreTokens())
				try {
					st=new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			return st.nextToken();
		}
		
		int nextInt() {
			return Integer.parseInt(next());
		}
		int[] readArray(int n) {
			int[] a=new int[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		Integer[] readArrayO(int n) {
			Integer[] a=new Integer[n];
			for (int i=0; i<n; i++) a[i]=nextInt();
			return a;
		}
		List<Integer> readArrayList(int n) {
			List<Integer> a=new ArrayList<>();
			for (int i=0; i<n; i++) a.add(nextInt());
			return a;
		}
		long nextLong() {
			return Long.parseLong(next());
		}
	}
}