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


/**
 *
 * @author sarthak
 */
import java.util.*;
import java.math.*;
import java.io.*;

public class rnd149_C {

    static class FastScanner {

        BufferedReader br;
        StringTokenizer st;

        public FastScanner(InputStream is) {
            br = new BufferedReader(new InputStreamReader(is));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public String nextLine() {
            st = null;
            try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }

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

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

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

    static class P implements Comparable {

        private int R, C;

        public P(int x, int y) {
            this.R = x;
            this.C = y;
        }

        public int hashCode() {
            return (R * 31) ^ C;
        }

        public boolean equals(Object o) {
            if (o instanceof P) {
                P other = (P) o;
                return (R == other.R && C == other.C);
            }
            return false;
        }

        public int compareTo(Object obj) {
            P l = (P) obj;
            if (this.R == l.R) {
                if (this.C == l.C) {
                    return 0;
                }
                return (this.C < l.C) ? -1 : 1;
            }
            return (this.R < l.R) ? -1 : 1;
        }
    }

   
    public static boolean  v(int r,int c){
        return (r>=1&&r<=1000000000)&&(c>=1&&c<=1000000000);
    }

    public static void main(String[] args) {

        FastScanner s = new FastScanner(System.in);
        StringBuilder op = new StringBuilder();
        int x0 = s.nextInt();
        int y0 = s.nextInt();
        int x1 = s.nextInt();
        int y1 = s.nextInt();
        int n = s.nextInt();
        HashSet<P> AV = new HashSet<>();
        while (n != 0) {

            int r = s.nextInt();
            int a = s.nextInt();
            int b = s.nextInt();
            for (int i = a; i <= b; i++) {
                AV.add(new P(r, i));
            }
            n--;
        }

        HashMap<P, Long> DIS = new HashMap<>();
        HashSet<P> VIS = new HashSet<>();
        Queue<P> q = new LinkedList<>();
        if (AV.contains(new P(x0, y0))) {
            DIS.put(new P(x0, y0), 0L);
            VIS.add(new P(x0, y0));
            q.add(new P(x0, y0));
        }
        int x[] = {0,-1,-1,1,0,1,1,-1},y[] = {-1,-1,0,-1,1,1,0,1};

        while (!q.isEmpty()) {

            P p = q.poll();
            long d=DIS.get(p);
            for(int i=0;i<8;i++){
                int r=p.R+x[i];int c=p.C+y[i];
                P cp=new P(r,c);
                long dis=d+1;
                if(v(r,c)&&AV.contains(cp)){
                    if(!DIS.containsKey(cp))
                        DIS.put(cp, Long.MAX_VALUE);
                     long cd=DIS.get(cp);
                     DIS.put(cp,Math.min(cd, dis));
                    
                    if(!VIS.contains(cp)){
                        VIS.add(cp);q.add(cp);
                    }
                    
                    
                }
            }   
         
        }
        
        if(!DIS.containsKey(new P(x1,y1)))
             System.out.println(-1);
        else System.out.println(DIS.get(new P(x1,y1)));

    }

}
