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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.Queue;
import java.util.LinkedList;
import java.util.HashSet;
import java.util.Collection;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Ziklon
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskC solver = new TaskC();
        solver.solve(1, in, out);
        out.close();
    }
}

class TaskC {

    int dx[]={0,0,1,-1,1,-1,1,-1};
    int dy[]={1,-1,0,0,1,-1,-1,1};
    int R=1000000000;
    class Nodo {
        int x,y;
        public Nodo(int a, int b){
            x=a;y=b;
        }



        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Nodo nodo = (Nodo) o;
            if (x != nodo.x) return false;
            if (y != nodo.y) return false;
            return true;
        }
        public int hashCode() {
            int result = x;
            result = 31 * result + y;
            return result;
        }
    }




    public void solve(int testNumber, InputReader in, PrintWriter out) {
        int xs,ys,xe,ye,N,r,a,b;
        xs=in.nextInt();
        ys=in.nextInt();
        xe=in.nextInt();
        ye=in.nextInt();
        N=in.nextInt();

        HashMap<Nodo,Integer> vis=new HashMap<Nodo, Integer>();

        ArrayList<Nodo> list=new ArrayList<Nodo>();
        HashSet<Nodo> tree=new HashSet<Nodo>();
        for(int i=0;i<N;i++){
            r=in.nextInt();
            a=in.nextInt();
            b=in.nextInt();
            for(int j=a;j<=b;j++)
                tree.add(new Nodo(r,j));
        }

        Queue<Nodo> Q=new LinkedList<Nodo>();
        Q.add(new Nodo(xs,ys));
        vis.put(new Nodo(xs,ys),0);
        int ans=-1;
        while(!Q.isEmpty()){
            Nodo cur=Q.poll();
            int cost=vis.get(cur);
            if(cur.x==xe && cur.y==ye){
                ans=cost;
                break;
            }
            for(int i=0;i<8;i++){
                int X=cur.x+dx[i];
                int Y=cur.y+dy[i];
                if(Math.min(X,Y)>=1 && Math.max(X,Y)<=R){
                    Nodo tmp=new Nodo(X,Y);
                    if(tree.contains(tmp) && !vis.containsKey(tmp)){
                        vis.put(tmp,cost+1);
                        Q.add(tmp);
                    }
                }
            }
        }
        out.println(ans);
    }
}

class InputReader {

    private BufferedReader reader;
    private StringTokenizer tokenizer;

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

    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
    public int nextInt() {
        return Integer.parseInt(next());
    }

}

