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.*;
import java.io.*;
import java.lang.*;

public class Main {
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader() {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException {
            din = new DataInputStream(new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n')
                    break;
                buf[cnt++] = (byte) c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException {
            int ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException {
            bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException {
            if (din == null)
                return;
            din.close();
        }
    }

    public static class pair {
        int l;
        int r;

        pair(int l, int r) {
            this.l = l;
            this.r = r;
        }
    }

    public static int[][] dir = { { 1, 0 }, { 0, 1 }, { -1, 0 }, { 0, -1 }, { 1, 1 }, { -1, -1 }, { -1, 1 },
            { 1, -1 } };

    public static boolean isAllowed(int r, int c, HashMap<Integer, ArrayList<Integer>> map) {
        if (map.containsKey(r)) {
            ArrayList<Integer> list = map.get(r);
            for (int ele : list)
                if (ele == c)
                    return true;
        }
        return false;
    }

    public static long bfs(int sr, int sc, int er, int ec, HashMap<Integer, ArrayList<Integer>> map) {
        Queue<Long> qu = new LinkedList<>();
        HashSet<Long> isVis = new HashSet<>();

        long num = (sr * (long) 1e9 + sc);
        qu.add(num);
        isVis.add(num);

        long level = 0;

        while (!qu.isEmpty()) {
            long size = qu.size();

            while (size-- > 0) {
                long rvtx = qu.remove();

                long cr = rvtx / (long) 1e9;
                long cc = rvtx % (long) 1e9;

                if ((int) cr == er && (int) cc == ec)
                    return level;

                for (int d = 0; d < 8; d++) {
                    long nr = cr + dir[d][0];
                    long nc = cc + dir[d][1];

                    long num2 = nr * (long) 1e9 + nc;

                    if (nr >= 1 && nc >= 1 && nr <= (long) 1e9 && nc <= (long) 1e9 && !isVis.contains(num2)
                            && isAllowed((int) nr, (int) nc, map)) {
                        qu.add(num2);
                        isVis.add(num2);
                    }
                }
            }
            level++;
        }
        return -1;
    }

    public static void main(String[] args) throws IOException {
        Reader scn = new Reader();
        StringBuilder res = new StringBuilder();
        int x_i = scn.nextInt();
        int y_i = scn.nextInt();
        int x_f = scn.nextInt();
        int y_f = scn.nextInt();

        int n = scn.nextInt();
        // HashSet<pair> set = new HashSet<>();
        HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();

        while (n-- > 0) {
            int r = scn.nextInt();
            int left = scn.nextInt();
            int right = scn.nextInt();

            ArrayList<Integer> list;
            if (map.containsKey(r)) {
                list = map.get(r);
            } else {
                list = new ArrayList<>();
            }

            for (int i = left; i <= right; i++)
                list.add(i);

            map.put(r, list);
        }
        res.append(bfs(x_i, y_i, x_f, y_f, map));
        System.out.print(res);
    }
}