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

/** https://codeforces.com/problemset/problem/242/C
 *  idea: use Dijkstra with adjacency matrix
 */

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.ArrayList;
import java.util.TreeMap;
import java.util.TreeSet;

public class KingPath {
    static int max_val = (int)1e9 + 1;
    static boolean isValidPoint(TreeSet<Point> graph, TreeSet<Point>visitedPoint, Point point) {
        if (point.x < 0 || point.x >= max_val) return false;
        if (point.y < 0 || point.y >= max_val) return false;
        // System.out.println("A");
        // for (Point p: graph) {
        //     System.out.print(p.x + "--" + p.y + ", ");
        // }
        if (!graph.contains(point)) return false;
        if (visitedPoint.contains(point)) return false;
        return true;
    }

    static void Dijkstra(TreeSet<Point> graph,  Point source, Point destination) {
        TreeSet<Point> visitedPoint = new TreeSet<>();
        visitedPoint.add(source);
        int[] dx = {-1, -1, -1, 0, 0, 1 ,1, 1};
        int[] dy = {-1, 0, 1, -1, 1, -1, 0, 1};
        
        TreeMap<Point, Integer> dist = new TreeMap<>();        
        dist.put(source, 0);

        Node startVertex = new Node(source, 0);
        PriorityQueue<Node> pq = new PriorityQueue<>();
        pq.add(startVertex);
        
        while (!pq.isEmpty()) {
            Node node = pq.poll();
            Point point = node.p;
            //System.out.println(point.x + "+" + point.y + ", ");
            int w = node.dist;
            visitedPoint.add(point);
            for (int i=0; i < dx.length; i++) {
                Point tmp = new Point(point.x + dx[i], point.y + dy[i]);
                //System.out.println(tmp.x + "-" + tmp.y + ", ");
                if (isValidPoint(graph, visitedPoint, tmp)) {
                    if (dist.containsKey(tmp)) {
                        if ( w + 1 < dist.get(tmp)) {
                            dist.replace(tmp, w+1);
                            pq.add(new Node(tmp, dist.get(tmp)));
                        }
                    } else {
                        dist.put(tmp, w+1);
                        pq.add(new Node(tmp, dist.get(tmp)));
                    }
                }
            }
        }

        if (dist.containsKey(destination)) {
            System.out.println(dist.get(destination));
        } else {
            System.out.println(-1);
        }

    }
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int x0 = sc.nextInt();
        int y0 = sc.nextInt();
        int x1 = sc.nextInt();
        int y1 = sc.nextInt();
        int n = sc.nextInt();
        TreeSet<Point> graph = new TreeSet<>();
        for(int i=0; i < n; i++) {
            int r = sc.nextInt();
            int a = sc.nextInt();
            int b = sc.nextInt();
            while (a <= b) {
                graph.add(new Point(r, a++));
            }
        }
        //System.out.println("All point: ");
        // for(Point p : graph) {
        //     System.out.print(p.x + "--" + p.y + ", ");
        // }
        // System.out.println("END");
        Dijkstra(graph, new Point(x0, y0), new Point(x1, y1));   
        // TreeSet<Point> visitedPoint = new TreeSet<>();
        // visitedPoint.add(new Point(5,7));
        // Point point = new Point(5, 6);   
        // System.out.println(isValidPoint(graph, visitedPoint, point));
    }
}


class Point implements Comparable<Point> {
    int x, y;
    Point( int _x, int _y) {
        this.x = _x; 
        this.y = _y;
    }

    public int compareTo(Point other) {
        if (this.x == other.x) {
            return this.y - other.y;
        } else {
            return this.x - other.x;
        }
    }
}

class Node implements Comparable<Node>{
    Point p;
    int dist;
    Node(Point _p, int _dist) {
        this.p = _p;
        this.dist = _dist;
    }
    public int compareTo(Node other) {
        return this.dist - other.dist;
    }
}