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.Scanner;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.AbstractCollection;
import java.util.LinkedList;
import java.util.HashSet;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author mdonaj
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		Scanner in = new Scanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskC {
	public void solve(int testNumber, Scanner in, PrintWriter out) {
        int x0 = in.nextInt(),
            y0 = in.nextInt(),
            x1 = in.nextInt(),
            y1 = in.nextInt();

        int n = in.nextInt();
        HashSet<Point> allowed = new HashSet<Point>();
        HashSet<Point> visited = new HashSet<Point>();
        
        for(int i = 0; i < n; ++i) {
           int r = in.nextInt();
           int a = in.nextInt();
           int b = in.nextInt();

            for(int j = a; j <= b; ++j)
                allowed.add(new Point(r, j));

        }

        LinkedList<Point> q = new LinkedList<Point>();
        Point beg = new Point(x0, y0);
        beg.l = 0;
        q.add(beg);
        visited.add(beg);

        while(!q.isEmpty()) {
            Point p = q.pollFirst();
            if(p.x == x1 && p.y == y1) {
                out.println(p.l);
                return;
            }

            Point p1 = new Point(p.x-1, p.y);
            p1.l = p.l + 1;
            Point p2 = new Point(p.x+1, p.y);
            p2.l = p.l + 1;
            Point p3 = new Point(p.x, p.y-1);
            p3.l = p.l + 1;
            Point p4 = new Point(p.x, p.y+1);
            p4.l = p.l + 1;
            Point p5 = new Point(p.x-1, p.y-1);
            p5.l = p.l + 1;
            Point p6 = new Point(p.x-1, p.y+1);
            p6.l = p.l + 1;
            Point p7 = new Point(p.x+1, p.y+1);
            p7.l = p.l + 1;
            Point p8 = new Point(p.x+1, p.y-1);
            p8.l = p.l + 1;

            if(allowed.contains(p1) && !visited.contains(p1)) {
                q.add(p1);
                visited.add(p1);
            }
            if(allowed.contains(p2) && !visited.contains(p2))
            {
                q.add(p2);
                visited.add(p2);
            }

            if(allowed.contains(p3) && !visited.contains(p3))
            {
                q.add(p3);
                visited.add(p3);
            }

            if(allowed.contains(p4) && !visited.contains(p4))
            {
                q.add(p4);
                visited.add(p4);
            }

            if(allowed.contains(p5) && !visited.contains(p5))
            {
                q.add(p5);
                visited.add(p5);
            }

            if(allowed.contains(p6) && !visited.contains(p6))
            {
                q.add(p6);
                visited.add(p6);
            }

            if(allowed.contains(p7) && !visited.contains(p7))
            {
                q.add(p7);
                visited.add(p7);
            }

            if(allowed.contains(p8) && !visited.contains(p8))
            {
                q.add(p8);
                visited.add(p8);
            }
        }


        out.print("-1");

	}

    private class Point{
        public int x,y;
        public int l;
        private Point(int x, int y) {
            this.x = x;
            this.y = y;
        }

        public boolean equals(Object o) {
            if (this == o) return true;
            if (!(o instanceof Point)) return false;

            Point point = (Point) o;

            if (x != point.x) return false;
            if (y != point.y) return false;

            return true;
        }

        public int hashCode() {
            int result = x%10009;

            result = 31 * result + (y%10009);
            return result;
        }
    }
}

