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

public class Solution {
    private static class Node {
		int row;
		int col;
		public Node(int row, int col) {
			this.row = row;
			this.col = col;
		}
		
		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + col;
			result = prime * result + row;
			return result;
		}
		
		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Node other = (Node) obj;
			if (col != other.col)
				return false;
			if (row != other.row)
				return false;
			return true;
		}
	}
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter out = new BufferedWriter(new OutputStreamWriter(System.out));
        String[] ins = br.readLine().trim().split(" ");
        int x1 = Integer.parseInt(ins[0]);
        int y1 = Integer.parseInt(ins[1]);
        int x2 = Integer.parseInt(ins[2]);
        int y2 = Integer.parseInt(ins[3]);
        int n = Integer.parseInt(br.readLine().trim());
        HashMap<Integer, LinkedList<int[]>> map = new HashMap<Integer, LinkedList<int[]>>(); 
        for (int i = 0; i < n; i++) {
            ins = br.readLine().trim().split(" ");
            int r = Integer.parseInt(ins[0]);
            int c1 = Integer.parseInt(ins[1]);
            int c2 = Integer.parseInt(ins[2]);
            if(!map.containsKey(r))
                map.put(r, new LinkedList<int[]>());
            map.get(r).addLast(new int[]{c1, c2});
        }
        Queue<Node> q = new LinkedList<Node>();
        HashSet<Node> visited = new HashSet<Node>();
        q.add(new Node(x1, y1));
        visited.add(new Node(x1, y1));
        int steps = 0;
        boolean isPossible = false;
        while(!q.isEmpty()) {
            int size = q.size();
            for(int i=0; i<size; i++) {
                Node p = q.poll();
                if(p.row == x2 && p.col == y2) {
                    isPossible = true;
                    break;
                }
                for(int j=-1; j<2; j++) {
                    for(int k=-1; k<2; k++) {
                        int tx = p.row + j;
                        int ty = p.col + k;
                        if(!map.containsKey(tx)) continue;
                        LinkedList<int[]> list = map.get(tx);
                        for(int[] l: list) {
                            if(ty >= l[0] && ty <= l[1] && !visited.contains(new Node(tx, ty))) {
                                q.add(new Node(tx, ty));
                                visited.add(new Node(tx, ty));
                                break;
                            }
                        }
                    }
                }
            }
            if(isPossible) break;
            steps++;
        }
        if(isPossible) System.out.println(steps);
        else System.out.println("-1");
    }
}
