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


/* 
Keep solving problems. 
*/
import java.util.*;
import java.io.*;

public class CF149C {

    BufferedReader br;
    PrintWriter out;
    StringTokenizer st;
    boolean eof;
    final long mod = 1000L * 1000L * 1000L + 7;
    int[] dx = {-1, 0, 1, -1, 1, -1, 0, 1};
    int[] dy = {-1, -1, -1, 0, 0, 1, 1, 1};
    void solve() throws IOException {
        long x0 = nextLong();
        long y0 = nextLong();
        long x1 = nextLong();
        long y1 = nextLong();

        Set<Long> hs = new HashSet<>();
        int n = nextInt();
        for(int i = 0; i < n; i++) {
            long row = nextLong();
            long low = nextLong();
            long high = nextLong();
            for(long l = low; l <= high; l++) {
                long val = row * mod + l;
                hs.add(val);
            }
        }
        Map<Long, Long> hm = new HashMap<>();
        LinkedList<Point> list = new LinkedList<>();
        list.add(new Point(x0, y0, 0));
        hm.put(mod * x0 + y0, 0L);
        while(!list.isEmpty()) {
            Point cur = list.poll();
            for(int i = 0; i < dx.length; i++) {
                long nextX = cur.x + dx[i];
                long nextY = cur.y + dy[i];
                long nextLoc = nextX * mod + nextY;
                if(hs.contains(nextLoc) && !hm.containsKey(nextLoc)) {
                    list.add(new Point(nextX, nextY, cur.dist + 1));
                    hm.put(nextLoc, cur.dist + 1);
                }
            }
        }
        long dest = x1 * mod + y1;
        if(hm.containsKey(dest)) {
            out(hm.get(dest));
        }
        else {
            out(-1);
        }
    }
    class Point {
        long x;
        long y;
        long dist;
        public Point(long x, long y, long dist) {
            this.x = x;
            this.y = y;
            this.dist = dist;
        }
    }
    void shuffle(int[] a) {
        int n = a.length;
        for(int i = 0; i < n; i++) {
            int r = i + (int) (Math.random() * (n - i));
            int tmp = a[i];
            a[i] = a[r];
            a[r] = tmp;
        }
    }
    private void outln(Object o) {
        System.out.println(o);
    }
    private void out(Object o) {
        System.out.print(o);
    }
    public CF149C() throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        out = new PrintWriter(System.out);
        solve();
        out.close();
    }
    public static void main(String[] args) throws IOException {
        new CF149C();
    }

    public long[] nextLongArr(int n) throws IOException{
        long[] res = new long[n];
        for(int i = 0; i < n; i++)
            res[i] = nextLong();
        return res;
    }
    public int[] nextIntArr(int n) throws IOException {
        int[] res = new int[n];
        for(int i = 0; i < n; i++)
            res[i] = nextInt();
        return res;
    }
    public String nextToken() {
        while (st == null || !st.hasMoreTokens()) {
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                eof = true;
                return null;
            }
        }
        return st.nextToken();
    }
    public String nextString() {
        try {
            return br.readLine();
        } catch (IOException e) {
            eof = true;
            return null;
        }
    }
    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }
    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }
    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }
}

