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.InputStream;
import java.io.InputStreamReader;
import java.util.*;
public class cf242c {
  public static void main(String[] args) {
    FastScanner in = new FastScanner(System.in);
    Pair start = new Pair(in.nextInt(),in.nextInt());
    Pair end = new Pair(in.nextInt(),in.nextInt());
    TreeSet<Pair> ok = new TreeSet<Pair>();
    int n = in.nextInt();
    for(int i=0; i<n; i++) {
      int x = in.nextInt();
      int y0 = in.nextInt();
      int y1 = in.nextInt();
      if(y1 < y0) {
        int tmp = y0;
        y0 = y1;
        y1 = tmp;
      }
      for(int y=y0; y<=y1; y++)
        ok.add(new Pair(x,y));
    }
    ArrayDeque<Pair> q = new ArrayDeque<Pair>();
    q.add(start);
    Map<Pair,Integer> map = new TreeMap<Pair,Integer>();
    map.put(start,0);
    int[] dx = {-1,-1,-1,0,0,1,1,1},dy = {1,0,-1,1,-1,1,0,-1};
    while(!q.isEmpty()) {
      Pair cur = q.poll();
      for(int i=0; i<dx.length; i++) {
        Pair next = new Pair(cur.x+dx[i],cur.y+dy[i]);
        if(!ok.contains(next)) continue;
        if(map.containsKey(next)) continue;
        q.add(next);
        map.put(next, map.get(cur)+1);
      }
    }
    int ans = -1;
    if(map.containsKey(end)) ans = map.get(end);
    System.out.println(ans);
  }
  static class Pair implements Comparable<Pair> {
    int x,y;
    Pair(int a, int b) {
      x=a;y=b;
    }
    public int compareTo(Pair p) {
      if(x==p.x) return y-p.y;
      return x-p.x;
    }
    public String toString() {
      return x+":"+y;
    }
  }
  static class FastScanner {
    BufferedReader br;
    StringTokenizer st;
    
    public FastScanner(InputStream in) {
      br = new BufferedReader(new InputStreamReader(in));
      scanLine();
    }
    public void scanLine() {
      try {
        st = new StringTokenizer(br.readLine().trim());
      } catch(Exception e) {
        throw new RuntimeException(e.getMessage());
      }
    }
    public int numTokens() {
      if(!st.hasMoreTokens()) {
        scanLine();
        return numTokens();
      }
      return st.countTokens();
    }
    public String next() {
      if(!st.hasMoreTokens()) {
        scanLine();
        return next();
      }
      return st.nextToken();
    }
    public double nextDouble() {
      return Double.parseDouble(next());
    }
    public long nextLong() {
      return Long.parseLong(next());
    }
    public int nextInt() {
      return Integer.parseInt(next());
    }
  }
}
