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

/**
 * Problem CF242C
 */
@SuppressWarnings("unchecked")
public class CF242C {

    private static int[][] MOVES = {
        {1,0},
        {1,1},
        {0,1},
        {-1,1},
        {-1,0},
        {-1,-1},
        {0,-1},
        {1,-1}
    };

    static class Task extends IOHandler {
        public void run() {
            King start = new King(in.nextLong(),in.nextLong(),0);
            King end = new King(in.nextLong(),in.nextLong(),0);
            Queue<King> Q = new LinkedList<>();
            Map<Long, Set<Long>> visited = new HashMap<>();
            Map<Long, List<Segment>> allowed = new HashMap<>();
            int n = in.nextInt();
            while(n-->0){
                long r = in.nextLong();
                long a = in.nextLong();
                long b = in.nextLong();
                allowed.computeIfAbsent(r, key -> new LinkedList<>())
                        .add(new Segment(r, a, b));
            }
            Q.add(start);
            visited.computeIfAbsent(start.x, key -> new HashSet<>()).add(start.y);
            long ans = -1;
            while(!Q.isEmpty()){
                King current = Q.remove();
                if(current.equals(end)){
                    ans=current.m;
                }
                for(int i = 0; i < MOVES.length; ++i){
                    long x = current.x + MOVES[i][0];
                    long y = current.y + MOVES[i][1];
                    if(!visited.computeIfAbsent(x, key->new HashSet<>()).contains(y) &&
                            allowed(allowed, x, y)) {
                        visited.get(x).add(y);
                        Q.add(new King(x, y, current.m + 1));
                    }
                }
            }
            out.println(ans);
        }

        private boolean allowed(Map<Long, List<Segment>> allowed, long x, long y){
            if(!allowed.containsKey(x)) return false;
            List<Segment> list = allowed.get(x);
            for(Segment seg : list){
                if(seg.contains(x, y)) return true;
            }
            return false;
        }
    }

    static class King {
        private long x;
        private long y;
        private long m;

        public King(long x, long y, long m){
            this.x = x;
            this.y = y;
            this.m = m;
        }

        public boolean equals(King other){
            return this.x==other.x&&this.y==other.y;
        }
    }

    static class Segment {
        private long r;
        private long a;
        private long b;

        public Segment(long r, long a, long b){
            this.r = r;
            this.a = a;
            this.b = b;
        }

        public boolean contains(long x, long y){
            return x==r&&a<=y&&y<=b;
        }
    }

    /***********************************************************
     *                        COMMONS                          *
     ***********************************************************/
    static class Pair<A, B> implements Comparable<Pair<A, B>> {
        public A a;
        public B b;
        public Pair(Pair<A, B> p) {
            this(p.a, p.b);
        }

        public Pair(A a, B b) {
            this.a = a;
            this.b = b;
        }

        public String toString() {
            return a+" "+b;
        }

        public int hashCode() {
            return Objects.hash(a, b);
        }

        public boolean equals(Object o) {
            if(o instanceof Pair) {
                Pair<A,B> p = (Pair<A,B>) o;
                return a.equals(p.a)&&b.equals(p.b);
            }
            return false;
        }

        @Override
        public int compareTo(Pair<A, B> p) {
            int cmp = ((Comparable<A>) a).compareTo(p.a);
            if(cmp==0) {
                return ((Comparable<B>) b).compareTo(p.b);
            }
            return cmp;
        }
    }

    /***********************************************************
     *                      BOILERPLATE                        *
     ***********************************************************/
    public static void main(String[] args) {
        Task task = new Task();
        task.run();
        task.cleanup();
    }

    static class IOHandler  {
        public InputReader in = new InputReader(System.in);
        public OutputWriter out = new OutputWriter(System.out);

        public void cleanup() {
            out.close();
        }
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        private boolean prime() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    String line = reader.readLine();
                    if(line==null) return false; // EOF
                    tokenizer = new StringTokenizer(line);
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return true;
        }
        
        public boolean hasNext() {
            return prime();
        }

        public String next() {
            prime();
            return tokenizer.nextToken();
        }

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

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

        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }

    static class OutputWriter extends PrintWriter {
        public OutputWriter(OutputStream out) {
            super(out);
        }

        public void println(String format, Object... args) {
            this.println(String.format(format, args));
        }

        public void print(String format, Object... args) {
            this.print(String.format(format, args));
        }
    }

}
