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.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Objects;
import java.util.Queue;
import java.util.StringTokenizer;

public class C {

  static class FastScanner {

    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");

    String next() {
      while (!st.hasMoreTokens()) {
        try {
          st = new StringTokenizer(br.readLine());
        } catch (IOException e) {
          e.printStackTrace();
        }
      }
      return st.nextToken();
    }


    int nextInt() {
      return Integer.parseInt(next());
    }


    int[] readArray(int n) {
      int[] a = new int[n];
      for (int i = 0; i < n; i++) {
        a[i] = nextInt();
      }
      return a;
    }

    long nextLong() {
      return Long.parseLong(next());
    }
  }

  static class Pair {

    int row;
    int col;
    int steps;

    public Pair(int row, int col, int steps) {
      this.row = row;
      this.col = col;
      this.steps = steps;
    }

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

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

  private static boolean inside(int row, int col) {
    return row >= 1 && col >= 1 && row <= Math.pow(10, 9) && col <= Math.pow(10, 9);
  }

  public static void main(String args[]) {
    FastScanner f = new FastScanner();
    int sx = f.nextInt(), sy = f.nextInt(), ex = f.nextInt(), ey = f.nextInt();
    int numTest = f.nextInt();
    HashMap<Integer, List<Integer[]>> valid = new HashMap<>();
    while (numTest-- > 0) {
      int vR = f.nextInt();
      List<Integer[]> vList = valid.getOrDefault(vR, new ArrayList<>());
      vList.add(new Integer[]{f.nextInt(), f.nextInt()});
      valid.put(vR, vList);
    }
    Queue<Pair> queue = new LinkedList<>();
    queue.add(new Pair(sx, sy, 0));
    HashSet<Pair> visited = new HashSet<>();
    while (!queue.isEmpty()) {
      Pair curr = queue.poll();
      if (curr.row == ex && curr.col == ey) {
        System.out.println(curr.steps);
        return;
      }
      if (!visited.contains(curr)) {
        visited.add(curr);
        int[][] dirs = new int[][]{{-1, 0}, {1, 0}, {0, 1}, {0, -1}, {-1, -1}, {1, -1}, {-1, 1}, {1, 1}};
        for (int[] dir : dirs) {
          int nX = curr.row + dir[0];
          int nY = curr.col + dir[1];
          if (inside(nX, nY) && possible(valid, nX, nY)) {
            queue.add(new Pair(nX, nY, curr.steps + 1));
          }
        }
      }
    }
    System.out.println(-1);
  }

  private static boolean possible(HashMap<Integer, List<Integer[]>> valid, int nX, int nY) {
    if (valid.containsKey(nX)) {
      for (Integer[] integers : valid.get(nX)) {
        if (nY >= integers[0] && nY <= integers[1]) {
          return true;
        }
      }
    }
    return false;
  }

}
