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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Objects;
import java.util.Collection;
import java.util.Scanner;
import java.util.Set;
import java.util.Deque;
import java.util.ArrayDeque;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskC
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int row_from = in.nextInt();
            int col_from = in.nextInt();
            int row_to = in.nextInt();
            int col_to = in.nextInt();
            Set<Cell> visited = new HashSet<>();
            Set<Cell> allowed = new HashSet<>();
            int N = in.nextInt();
            while (N-- > 0)
            {
                int row = in.nextInt();
                int colStart = in.nextInt();
                int colEnd = in.nextInt();
                for (int i = colStart; i <= colEnd; i++)
                {
                    allowed.add(new Cell(row, i));
                }
            }
            int moves = visit(row_from, col_from, row_to, col_to, visited, allowed);
            out.println(moves);
        }

        private int visit(int row_from, int col_from, int row_to, int col_to, Set<Cell> visited, Set<Cell> allowed)
        {
            Deque<Location> q = new ArrayDeque<>();
            q.add(new Location(row_from, col_from, 0));
            while (!q.isEmpty())
            {
                Location currentLocation = q.pollFirst();
                if (!allowed.contains(new Cell(currentLocation.row, currentLocation.col))) continue;
                if (visited.contains(new Cell(currentLocation.row, currentLocation.col))) continue;
                if (currentLocation.row == row_to && currentLocation.col == col_to) return currentLocation.depth;
                visited.add(new Cell(currentLocation.row, currentLocation.col));
                // moves
                int[][] offsets = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}, {-1, -1}, {1, -1}, {-1, 1}, {1, 1}};
                for (int offset[] : offsets)
                {
                    int row_offset = offset[0];
                    int col_offset = offset[1];
                    q.add(new Location(currentLocation.row + row_offset, currentLocation.col + col_offset, currentLocation.depth + 1));
                }
            }
            return -1;
        }

    }

    static class Location
    {
        int row;
        int col;
        int depth;

        Location(int row, int column, int depth)
        {
            this.row = row;
            this.col = column;
            this.depth = depth;
        }

    }

    static class Cell
    {
        int row;
        int col;

        Cell(int row, int col)
        {
            this.row = row;
            this.col = col;
        }

        public boolean equals(Object o)
        {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Cell cell = (Cell) o;
            return row == cell.row && col == cell.col;
        }

        public int hashCode()
        {
            return Objects.hash(row, col);
        }

    }
}

