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

public class Main {
    static int pow(int base, int exp)
    {
        int res = 1;
        while(exp > 0)
        {
            if(exp % 2 == 1)
                res *= base;
            base *= base;
            exp /= 2;
        }
        return res;
    }
    static class Row
    {
        ArrayList<Integer> valids;
        public Row(int l, int r)
        {
            if(this.valids == null)
                valids = new ArrayList<Integer>();
            valids.add(l);
            valids.add(r);
        }
    }
    static class Node
    {
        int i;
        int j;
        long val;
        public Node(int i, int j, long val)
        {
            this.i = i;
            this.j = j;
            this.val = val;
        }
    }
    static HashMap<Integer, Row> my;
    static HashSet<Point> vis;
    static int p, q;
    static void zap() throws IOException {
        int x, y;
        x = nextInt() - 1;
        y = nextInt() - 1;
        p = nextInt() - 1;
        q = nextInt() - 1;
        int n = nextInt();
        my = new HashMap<Integer, Row>();
        vis = new HashSet<Point>();
        for(int i=0;i<n;i++)
        {
            int r = nextInt() - 1;
            int a = nextInt() - 1;
            int b = nextInt() - 1;
            my.put(r, new Row(a, b));
        }
        out.println(bfs(new Node(x,y,0)));
    }
    static long bfs(Node O)
    {
        int[][] dir = {{1, 0}, {1, -1}, {0, -1}, {-1, -1}, {-1, 0}, {-1, 1}, {0, 1}, {1, 1}};
        Queue<Node> queue = new LinkedList<Node>();
        queue.add(O);
        vis.add(new Point(O.i, O.j));
        while(!queue.isEmpty())
        {
            Node head = queue.poll();
            if(head.i == p && head.j == q)
                return head.val;
            for(int[] c : dir)
            {
                int new_i = head.i + c[0];
                int new_j = head.j + c[1];
                Point temp = new Point(new_i, new_j);
                if(!vis.contains(temp) && within(new_i, new_j))
                {
                    if(my.containsKey(new_i))
                    {
                        Row thisOne = my.get(new_i);
                        for(int m=0;m<thisOne.valids.size();m+=2)
                        {
                            if(new_j >= thisOne.valids.get(m) && new_j <= thisOne.valids.get(m+1))
                            {
                                queue.add(new Node(new_i, new_j, head.val + 1));
                                vis.add(new Point(new_i, new_j));
                                break;
                            }
                        }
                    }
                }
            }
        }
        return -1;
    }
    static boolean within(int i, int j)
    {
        if(i >=0 && i < 1000000000 && j >= 0 && j < 1000000000)
            return true;
        return false;
    }

    static BufferedReader br;
    static StringTokenizer st;
    static PrintWriter out;

    public static void main(String[] args) throws IOException {
        InputStream input = System.in;
        br = new BufferedReader(new InputStreamReader(input));
        out = new PrintWriter(System.out);
        zap();
        out.close();
    }

    static long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    static int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    static String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            String line = br.readLine();
            if (line == null) {
                return null;
            }
            st = new StringTokenizer(line);
        }
        return st.nextToken();
    }
}