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.*;


public class test {
    int INF = (int)1e9;
    long MOD = 1000000007;

    long mk(long x, long y) {
        return x * 1000_000_0000l + y;
    }

    void solve(InputReader in, PrintWriter out) throws IOException {
        int x0 = in.nextInt();
        int y0 = in.nextInt();
        int x1 = in.nextInt();
        int y1 = in.nextInt();
        int n = in.nextInt();
        int[][] dir = new int[][]{{-1, -1}, {-1, 0}, {-1, 1}, {0, -1}, {0, 1},
                                {1, -1}, {1, 0}, {1, 1}};
        HashMap<Long, Integer> mp = new HashMap<>();
        ArrayList<HashSet<Integer>> g = new ArrayList<>();
        int keyId = 0;
        for(int i=0; i<n; i++) {
            int ri = in.nextInt();
            int ai = in.nextInt();
            int bi = in.nextInt();
            for(int j=ai; j<=bi; j++) {
                long k = mk(ri, j);
                if(!mp.containsKey(k)) {
                    mp.put(k, keyId++);
                    g.add(new HashSet<Integer>());
                }
                int u = mp.get(k);
                for(int[] d: dir) {
                    long x = mk(ri+d[0], j+d[1]);
                    if(mp.containsKey(x)) {
                        int v = mp.get(x);
                        g.get(u).add(v);
                        g.get(v).add(u);
                    }
                }
            }
        }
        // show("-------------");
        // int ct = 0;
        // for(HashSet<Integer> x: g) {
        //     show(ct++, x);
        // }
        // show("");
        // show(mp);
        n = g.size();
        int[] lvl = new int[n];
        Arrays.fill(lvl, -1);
        boolean[] vis = new boolean[n];
        int s = mp.get(mk(x0, y0));
        int f = mp.get(mk(x1, y1));
        Queue<Integer> q = new LinkedList<Integer>();
        vis[s] = true;
        lvl[s] = 0;
        q.add(s);
        bfs: while(q.size()>0) {
            int v = q.remove();
            for(int u: g.get(v)) {
                if(!vis[u]) {
                    lvl[u] = lvl[v]+1;
                    vis[u] = true;
                    q.add(u);
                    if(u==f) break bfs;
                }
            }
        }
        out.println(lvl[f]);
    }
    

    public static void main(String[] args) throws IOException {
        if(args.length>0 && args[0].equalsIgnoreCase("d")) {
            DEBUG_FLAG = true;
        }
        InputReader in = new InputReader();
        PrintWriter out = new PrintWriter(System.out);
        int t = 1;//in.nextInt();
        long start = System.nanoTime();
        while(t-- >0) {
            new test().solve(in, out);
        }
        long end = System.nanoTime();
        debug("\nTime: " + (end-start)/1e6 + " \n\n");
        out.close();
    }
    
    static boolean DEBUG_FLAG = false;
    static void debug(String s) {
        if(DEBUG_FLAG) System.out.print(s);
    }
    
    public static void show(Object... o) {
        System.out.println(Arrays.deepToString(o));
    }
    
    static class InputReader {
        static BufferedReader br;
        static StringTokenizer st;
    
        public InputReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }
        
        String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        
        int nextInt() {
            return Integer.parseInt(next());
        }
        
        long nextLong() {
            return Long.parseLong(next());
        }
        
        double nextDouble() {
            return Double.parseDouble(next());
        }
    }
}