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

// package Practice3.CF242;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;
import java.util.TreeSet;

public class CF242C {
    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int[] first = new int[2];
        int[] second = new int[2];
//        HashMap<Integer, TreeSet<pair>> map = new HashMap<>();
        TreeSet<pair> set = new TreeSet<>();
        for (int i = 0; i < 2; i++) {
            first[i] = s.nextInt();
        }

//        set.add(new pair(47,31));
        for (int i = 0; i < 2; i++) {
            second[i] = s.nextInt();
        }

        int q = s.nextInt();
        for (int i = 0; i < q; i++) {
            int a = s.nextInt();
            int b = s.nextInt();
            int c = s.nextInt();
            for (int j = b; j <= c; j++) {
                set.add(new pair(a,j));
            }
        }

        TreeSet<pair> visited = new TreeSet<>();
        Queue<pair> queue = new LinkedList<>();
        queue.add(new pair(first[0],first[1]));
        queue.add(null);

        int[] dx = {0,0,1,1,1,-1,-1,-1};
        int[] dy = {-1,1,-1,0,1,-1,0,1};
        visited.add(new pair(first[0],first[1]));

        int count = 0;
        while (!queue.isEmpty()){
            pair p = queue.poll();
            if(p != null && p.equals(new pair(second[0],second[1]))){
//                return count;
                System.out.println(count);
                break;
            }
            if(p == null){
                p = queue.poll();
                count++;
                if(p == null){
                    System.out.println(-1);
                    break;
                }else if(p.equals(new pair(second[0],second[1]))){
                    System.out.println(count);
                    break;
                }
                queue.add(null);
            }
            for (int i = 0; i < 8; i++) {
                pair p1 = new pair(p.x + dx[i],p.y + dy[i]);
                if(!visited.contains(p1) && set.contains(p1)) {
                    queue.add(p1);
                    visited.add(p1);
                }
            }
        }
    }

    private static class pair implements Comparable<pair>{
        int x;
        int y;

        @Override
        public boolean equals(Object obj) {
            pair p = (pair)obj;
            return this.x == p.x && this.y == p.y;
        }

        @Override
        public int hashCode() {
            return this.x *31 + this.y *47;
        }

        public pair(int from, int to) {
            this.x = from;
            this.y = to;
        }

        @Override
        public int compareTo(pair o) {
            if(this.x == o.x){
                return Integer.compare(this.y,o.y);
            }
            return Integer.compare(this.x, o.x);
        }

        @Override
        public String toString() {
            return this.x + " " + this.y;
        }
    }
}