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 P242C
{
    public static StringTokenizer st;
    public static void nextLine(BufferedReader br) throws IOException
    {
        st = new StringTokenizer(br.readLine());
    }
    
    public static String next()
    {
        return st.nextToken();
    }
    
    public static int nextInt()
    {
        return Integer.parseInt(st.nextToken());
    }
    
    public static long nextLong()
    {
        return Long.parseLong(st.nextToken());
    }
    
    public static double nextDouble()
    {
        return Double.parseDouble(st.nextToken());
    }
    
    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        nextLine(br);
        int x0 = nextInt();
        int y0 = nextInt();
        int x1 = nextInt();
        int y1 = nextInt();
        nextLine(br);
        int n = nextInt();
        HashMap<Integer, ArrayList<Pair>> map = new HashMap<Integer, ArrayList<Pair>>();
        for (int i = 0; i < n; i++)
        {
            nextLine(br);
            int r = nextInt();
            int a = nextInt();
            int b = nextInt();
            if (map.containsKey(r))
            {
                map.get(r).add(new Pair(a, b));
            }
            else
            {
                ArrayList<Pair> list = new ArrayList<Pair>();
                list.add(new Pair(a, b));
                map.put(r, list);
            }
        }
        for (Map.Entry<Integer, ArrayList<Pair>> entry : map.entrySet())
        {
            ArrayList<Pair> list = entry.getValue();
            ArrayList<Pair> temp = new ArrayList<Pair>();
            temp.addAll(list);
            list.clear();
            Collections.sort(temp);
            int lb = -1;
            int rb = -1;
            for (int i = 0; i < temp.size(); i++)
            {
                if (lb == -1)
                {
                    lb = temp.get(i).x;
                    rb = temp.get(i).y;
                    continue;
                }
                if (temp.get(i).x <= rb + 1)
                {
                    rb = Math.max(rb, temp.get(i).y);
                }
                else
                {
                    list.add(new Pair(lb, rb));
                    lb = temp.get(i).x;
                    rb = temp.get(i).y;
                }
            }
            list.add(new Pair(lb, rb));
        }
        HashMap<Pair, Integer> dists = new HashMap<Pair, Integer>();
        Pair start = new Pair(x0, y0);
        dists.put(start, 0);
        LinkedList<Pair> queue = new LinkedList<Pair>();
        queue.offer(start);
        int found = -1;
        while (!queue.isEmpty())
        {
            Pair pos = queue.poll();
            int d = dists.get(pos);
            for (int i = -1; i <= 1; i++)
            {
                for (int j = -1; j <= 1; j++)
                {
                    Pair next = new Pair(pos.x + i, pos.y + j);
                    if (dists.containsKey(next))
                    {
                        continue;
                    }
                    if (next.x == x1 && next.y == y1)
                    {
                        found = d+1;
                        break;
                    }
                    if (exists(map, next.x, next.y))
                    {
                        dists.put(next, d+1);
                        queue.offer(next);
                    }
                }
            }
            if (found != -1)
            {
                break;
            }
        }
        System.out.println(found);
    }
    
    private static boolean exists(HashMap<Integer, ArrayList<Pair>> map, int x, int y)
    {
        ArrayList<Pair> list = map.get(x);
        if (list == null) return false;
        int l = 0, r = list.size() - 1;
        while (l < r)
        {
            int m = (l + r) / 2;
            if (list.get(m).x <= y && list.get(m).y >= y)
            {
                return true;
            }
            if (list.get(m).y < y)
            {
                l = m+1;
            }
            else
            {
                r = m;
            }
        }
        
        return list.get(l).x <= y && list.get(l).y >= y;
    }
    
    public static class Pair implements Comparable<Pair>
    {
        int x, y;
        public Pair (int xx, int yy)
        {
            x = xx;
            y = yy;
        }
        
        public int hashCode()
        {
            return (x*7) ^ y;
        }

        public boolean equals(Object o)
        {
            if (!(o instanceof Pair)) return false;
            Pair p = (Pair)o;
            return x == p.x && y == p.y;
        }

        @Override
        public int compareTo(Pair o)
        {
            if (x == o.x)
            {
                return y - o.y;
            }
            else return x-o.x;
        }
    }
}