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.Closeable;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;

public class KingsPath implements Closeable {

    private InputReader in = new InputReader(System.in);
    private PrintWriter out = new PrintWriter(System.out);

    public void solve() {
        int x0 = in.ni(), y0 = in.ni(), x1 = in.ni(), y1 = in.ni();
        int[] distance = new int[100000];
        for (int i = 0; i < 100000; i++) {
            graph.add(new ArrayList<>());
            distance[i] = -1;
        }
        int n = in.ni();
        for (int i = 0; i < n; i++) {
            int row = in.ni(), start = in.ni(), end = in.ni();
            for (int j = start; j <= end; j++) {
                build(row, j);
            }
        }
        
        int start = numberToIndex.get(getNumber(x0, y0)), end = numberToIndex.get(getNumber(x1, y1));
        ArrayDeque<Integer> queue = new ArrayDeque<>();
        queue.addLast(start);
        distance[start] = 0;
        while (!queue.isEmpty()) {
            int u = queue.pollFirst();
            for (int v : graph.get(u)) {
                if (distance[v] == -1) {
                    distance[v] = distance[u] + 1;
                    queue.offerLast(v);
                }
            }
        }
        out.println(distance[end]);
    }

    private final long MAX = (long) 1e9;
    private List<List<Integer>> graph = new ArrayList<>();
    private Map<Long, Integer> numberToIndex = new HashMap<>();
    private int next = 0;

    private void build(int row, int col) {
        long number = getNumber(row, col);
        if (!numberToIndex.containsKey(number)) {
            numberToIndex.put(number, next);
            
            long left = -1, right = -1, up = -1, down = -1, nw = -1, ne = -1, sw = -1, se = -1;
            if (row != 1) up = number - MAX;
            if (row != MAX) down = number + MAX;
            if (col != 1) left = number - 1;
            if (col != MAX) right = number + 1;
            
            if (row != 1 && col != 1) nw = up - 1;
            if (row != 1 && col != MAX) ne = up + 1;
            if (row != MAX && col != MAX) se = down - 1;
            if (row != MAX && col != 1) sw = down + 1;

            addEdge(left);
            addEdge(up);
            addEdge(right);
            addEdge(down);
            addEdge(nw);
            addEdge(ne);
            addEdge(sw);
            addEdge(se);
            
            next++;
        }
    }
    
    private void addEdge(long number) {
        if (numberToIndex.containsKey(number)) {
            graph.get(next).add(numberToIndex.get(number));
            graph.get(numberToIndex.get(number)).add(next);
        }
    }

    private long getNumber(int row, int col) {
        return (row - 1) * MAX + col;
    }

    @Override
    public void close() throws IOException {
        in.close();
        out.close();
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int ni() {
            return Integer.parseInt(next());
        }

        public long nl() {
            return Long.parseLong(next());
        }

        public void close() throws IOException {
            reader.close();
        }
    }

    public static void main(String[] args) throws IOException {
        try (KingsPath instance = new KingsPath()) {
            instance.solve();
        }
    }
}
