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

public class P_242C {
    static final FS sc = new FS();
    static final PrintWriter pw = new PrintWriter(System.out);
    static class Pair implements Comparable<Pair>{
        int x, y;
        Pair(int x, int y){
            this.x = x;
            this.y = y;
        }

        @Override
        public int compareTo(Pair o) {
            if(this.x==o.x) return this.y-o.y;
            return this.x-o.x;
        }
    }
    static boolean isValid(int x, int y){
        return x>=0 && x<1e9 && y>=0 && y<1e9;
    }
    public static void main(String[] args) {
        int x0 = sc.nextInt();
        int y0 = sc.nextInt();
        int x1 = sc.nextInt();
        int y1 = sc.nextInt();
        int n = sc.nextInt();
        int[] dx = {1,1,0,-1,-1,-1,0,1};
        int[] dy = {0,1,1,1,0,-1,-1,-1};
        HashMap<Integer, HashSet<Integer>> cells = new HashMap<>();
        for(int i=0; i<n; i++){
            int r = sc.nextInt();
            int a = sc.nextInt();
            int b = sc.nextInt();
            if(!cells.containsKey(r))
                cells.put(r, new HashSet<>());
            for(int j=a; j<=b; j++){
                cells.get(r).add(j);
            }
        }
        TreeMap<Pair,Integer> d = new TreeMap<>();
        Queue<Pair> q = new LinkedList<>();
        q.add(new Pair(x0, y0));
        d.put(new Pair(x0, y0), 0);
        while(!q.isEmpty()){
            Pair p = q.poll();
            for(int i=0; i<8; i++){
                int x = p.x+dx[i];
                int y = p.y+dy[i];
                if (isValid(x, y) && cells.containsKey(x) && cells.get(x).contains(y) && !d.containsKey(new Pair(x, y))) {
                    q.add(new Pair(x,y));
                    d.put(new Pair(x,y), d.get(p)+1);
                }
            }
        }
        System.out.println(d.containsKey(new Pair(x1,y1))?d.get(new Pair(x1,y1)):-1);
    }

    static class FS {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer("");

        String next() {
            while (!st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception ignored) {
                }
            }
            return st.nextToken();
        }

        int[] nextArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextInt();
            }
            return a;
        }

        long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) {
                a[i] = nextLong();
            }
            return a;
        }

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

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