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.util.*;
import java.io.*;

public class CodeForces {

    public static void main(String[] args) throws IOException {
        Reader.init(System.in);
        long x1 = Reader.nextInt(), y1 = Reader.nextInt();
        long x2 = Reader.nextInt(), y2 = Reader.nextInt();
        
        int n = Reader.nextInt();
        int cnt = 0;
        HashSet<Long> avil = new HashSet();
        HashSet<Long> vis = new HashSet();
        long codeX = 1000000001;
        
        for(int i = 0; i < n; i++) {
            long r = Reader.nextInt();
            int a = Reader.nextInt(), b = Reader.nextInt();
            
            for (int j = a; j <= b; j++)
                avil.add(r*codeX+j);
        }
        
        
        long src = x1 * codeX + y1;
        long dist = x2 * codeX + y2;
        
        Queue q = new Queue(1000000);
        q.push(src);
        vis.add(src);
        int depth = 0;
        
        while(!q.isEmpty()){
            int size = q.size;
            depth++;
            
            for (int i = 0; i < size; i++) {
                long ne = q.pop();
                long x = ne / codeX;
                long y = ne % codeX;
                
                for (int j = 0; j < 8; j++) {
                    long xi = x + dx[j]; 
                    long yi = y + dy[j];
                    long e = xi * codeX + yi;
                    
                    if(e == dist){
                        System.out.println(depth);
                        return;
                    }
                    
                    if(avil.contains(e) && !vis.contains(e)){
                        q.push(e);
                        vis.add(e);
                    }
                }
            }
        }
        
        System.out.println(-1);
    }
    
    static boolean v[];
    static Pair arr[];
    static ArrayList<Integer> g[];
    static int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
    static int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
}

class Queue{
    int first = -1, last = -1, size = 0;
    long arr[];
    
    Queue(int n){
        arr = new long[n+10];
    }
    
    long pop(){
        size--;
        return arr[++first];
    }
    
    void push(long x){
        size++;
        arr[++last] = x;
    }
    
    boolean isEmpty(){
        return first == last;
    }
}
class Pair implements Comparable<Pair> {

    int x;
    int y;

    Pair(int a, int b) {
        x = a;
        y = b;
    }

    @Override
    public int compareTo(Pair t) {
        return x - t.x;
    }

    @Override
    public int hashCode() {
        return 1;
    }

    @Override
    public boolean equals(Object o) {
        return ((Pair)o).x == x && ((Pair)o).y == y;
    }
    
    
    
    
}

class Reader {

    static BufferedReader reader;
    static StringTokenizer tokenizer;

    public static int pars(String x) {
        int num = 0;
        int i = 0;
        if (x.charAt(0) == '-') {
            i = 1;
        }
        for (; i < x.length(); i++) {
            num = num * 10 + (x.charAt(i) - '0');
        }

        if (x.charAt(0) == '-') {
            return -num;
        }

        return num;
    }

    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input));
        tokenizer = new StringTokenizer("");
    }

    static void init(FileReader input) {
        reader = new BufferedReader(input);
        tokenizer = new StringTokenizer("");
    }

    static String next() throws IOException {
        while (!tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(
                    reader.readLine());
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return pars(next());
    }

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

    static double nextDouble() throws IOException {
        return Double.parseDouble(next());
    }
}
