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

/**
 * 242C
 *
 * @author artyom
 */
public class KingsPath implements Runnable {
    private BufferedReader in;
    private PrintStream out;
    private StringTokenizer tok;

    private void solve() throws IOException {
        int sx = nextInt(), sy = nextInt(), dx = nextInt(), dy = nextInt();
        Map<Integer, Set<Integer>> rows = readIntervals();
        out.print(bfs(rows, sx, sy, dx, dy));
    }

    private int bfs(Map<Integer, Set<Integer>> rows, int sx, int sy, int dx, int dy) {
        Set<Vertex> visited = new HashSet<>();
        Queue<Vertex> q = new LinkedList<>();
        q.add(new Vertex(sx, sy, 0));
        Vertex target = new Vertex(dx, dy, 0);
        while (!q.isEmpty()) {
            Vertex vertex = q.remove();
            if (vertex.equals(target)) {
                return vertex.len;
            }
            adjVertices(rows, vertex).stream().filter(v -> !visited.contains(v)).forEach(v -> {
                q.add(v);
                visited.add(v);
            });
        }
        return -1;
    }

    private static Collection<Vertex> adjVertices(Map<Integer, ? extends Set<Integer>> rows, Vertex vertex) {
        List<Vertex> vertices = new LinkedList<>();
        Set<Integer> intervals = rows.get(vertex.x);
        if (intervals.contains(vertex.y + 1)) {
            vertices.add(new Vertex(vertex.x, vertex.y + 1, vertex.len + 1));
        }
        if (intervals.contains(vertex.y - 1)) {
            vertices.add(new Vertex(vertex.x, vertex.y - 1, vertex.len + 1));
        }
        harvestVertices(vertex, vertices, rows.get(vertex.x - 1), vertex.x - 1);
        harvestVertices(vertex, vertices, rows.get(vertex.x + 1), vertex.x + 1);
        return vertices;
    }

    private static void harvestVertices(Vertex vertex, List<Vertex> vertices, Set<Integer> intervals, int x) {
        if (intervals != null) {
            if (intervals.contains(vertex.y)) {
                vertices.add(new Vertex(x, vertex.y, vertex.len + 1));
            }
            if (intervals.contains(vertex.y + 1)) {
                vertices.add(new Vertex(x, vertex.y + 1, vertex.len + 1));
            }
            if (intervals.contains(vertex.y - 1)) {
                vertices.add(new Vertex(x, vertex.y - 1, vertex.len + 1));
            }
        }
    }

    private Map<Integer, Set<Integer>> readIntervals() throws IOException {
        Map<Integer, Set<Integer>> rows = new HashMap<>();
        for (int i = 0, n = nextInt(); i < n; i++) {
            int r = nextInt(), a = nextInt(), b = nextInt();
            Set<Integer> intervals = rows.get(r);
            if (intervals == null) {
                rows.put(r, intervals = new HashSet<>());
            }
            for (int j = a; j <= b; j++) {
                intervals.add(j);
            }
        }
        return rows;
    }

    //--------------------------------------------------------------
    public static void main(String[] args) {
        new KingsPath().run();
    }

    @Override
    public void run() {
        try {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = System.out;
            tok = null;
            solve();
            in.close();
        } catch (IOException e) {
            System.exit(0);
        }
    }

    private String nextToken() throws IOException {
        while (tok == null || !tok.hasMoreTokens()) {
            tok = new StringTokenizer(in.readLine());
        }
        return tok.nextToken();
    }

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

    //--------------------------------------------------------------

    private static final class Vertex {
        final int x, y, len;

        Vertex(int x, int y, int len) {
            this.x = x;
            this.y = y;
            this.len = len;
        }

        @Override
        public boolean equals(Object o) {
            if (this == o) {
                return true;
            }
            if (o == null || getClass() != o.getClass()) {
                return false;
            }

            Vertex vertex = (Vertex) o;

            return x == vertex.x && y == vertex.y;
        }

        @Override
        public int hashCode() {
            int result = x;
            result = 31 * result + y;
            return result;
        }
    }
}