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.awt.Point;
import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class KingMoves {
    static Map<Integer, List<Point>> segments;
    static Set<Point> visited;
    static int[][] deltas = {{0,1},{1,0},{-1,0},{0,-1},{-1,-1},{1,-1},{-1,1},{1,1}};
    public static void main(String[] args) {
        MyReader mr = new MyReader();
        int x0 = mr.nextInt();
        int y0 = mr.nextInt();
        int x1 = mr.nextInt();
        int y1 = mr.nextInt();

        Point start = new Point(x0,y0);
        Point end = new Point(x1,y1);

        int n = mr.nextInt();
        segments = new HashMap<>();
        visited = new HashSet<>();

        for (int i = 0; i < n; i++) {
            int r= mr.nextInt();
            int a =mr.nextInt();
            int b= mr.nextInt();
            Point tmp = new Point(a,b);

            if(segments.containsKey(r)){
                segments.get(r).add(tmp);
            }
            else{
                List<Point> l = new ArrayList<>();
                l.add(tmp);
                segments.put(r,l);
            }
        }

        int res = 0;
        Queue<Point> q = new LinkedList<>();
        q.add(start);
        visited.add(start);

        while (!q.isEmpty()){
            Queue<Point> nextGen = new LinkedList<>();
            while (!q.isEmpty()){
                Point curr = q.poll();
                if(curr.equals(end)){
                    System.out.println(res);
                    return;
                }

                for(int[] d: deltas){
                    int x = curr.x+d[0];
                    int y = curr.y + d[1];

                    if(valid(x,y)){
                        Point tmp = new Point(x,y);
                        visited.add(tmp);
                        nextGen.add(tmp);
                    }
                }
            }

            res++;
            q = nextGen;
        }

        System.out.println(-1);




    }

    private static boolean valid(int x, int y) {
        Point tmp = new Point(x,y);
        if(!visited.contains(tmp) && segments.containsKey(x)){
            for(Point p : segments.get(x)){
                if(p.x <= y && y <= p.y)return true;
            }
            return false;
        }

        return false;
    }

    static class MyReader {
        BufferedReader br;
        StringTokenizer st;

        MyReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                    e.printStackTrace();
                }
            }

            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

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

        String nextLine() {
            String res = "";
            try {
                res = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }

            return res;
        }

        Integer[] nextIntArray(int n) {
            Integer[] arr = new Integer[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextInt();
            }

            return arr;
        }

        Long[] nextLongArray(int n) {
            Long[] arr = new Long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = nextLong();
            }

            return arr;
        }

        String[] nextStringArray(int n) {
            String[] arr = new String[n];
            for (int i = 0; i < n; i++) {
                arr[i] = next();
            }
            return arr;
        }
    }

    static void swap(int[] arr, int i, int j) {
        int tmp = arr[i];
        arr[i] = arr[j];
        arr[j] = tmp;
    }

}


