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

public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(in, out);
        out.close();
    }
}

class TaskC {
    public static class PointDist{
        Point p;
        int steps;
        public PointDist(Point p, int steps) {
            super();
            this.p = p;
            this.steps = steps;
        }
    }
    public void solve(InputReader in, PrintWriter out) {
        int x0 = in.nextInt();
        int y0 = in.nextInt();
        Point xy0 = new Point(x0, y0);
        int x1 = in.nextInt();
        int y1 = in.nextInt();
        Point xy1 = new Point(x1, y1);
        int n = in.nextInt();
        HashSet<Point> points = new HashSet<Point>();
        int r, a, b;
        for(int i=0; i<n; i++){
            r = in.nextInt();
            a = in.nextInt();
            b = in.nextInt();
            while(a<=b){
                points.add(new Point(r, a));
                a++;
            }
        }
        LinkedList<PointDist> queue = new LinkedList<PointDist>();
        queue.add(new PointDist(xy0, 0));
        Point p, np;
        while(!queue.isEmpty()){
            PointDist pz = queue.remove();
            p = pz.p;
            for(int dx=-1; dx<2; dx++){
                for(int dy=-1; dy<2; dy++){
                    if(dx == 0 && dy == 0)
                        continue;
                    np = new Point(((int)p.getX())+dx, ((int)p.getY())+dy);
                    if(np.equals(xy1)){
                        out.println(1+pz.steps);
                        return;
                    }
                    if(points.contains(np)){
                        queue.add(new PointDist(np, pz.steps + 1));
                        points.remove(np);
                    }
                }
            }
        }
        out.println(-1);
    }
}

class InputReader {
    private BufferedReader reader;
    private StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream));
        tokenizer = null;
    }

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public int nextInts(){
        //return map(lambda x: Integer.parseInt(x), in.readLine().trim().split("[ ]+"));
        return 1;
    }

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

}