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 B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int sx = in.nextInt();
		int sy = in.nextInt();
		int ex = in.nextInt();
		int ey = in.nextInt();

		int minX, minY, maxX, maxY;
		minX = minY = Integer.MAX_VALUE;
		maxX = maxY = 0;


		HashMap<Integer, Vector<Pair>> map = new HashMap();
		int tmp = in.nextInt();
		for(int i = 0 ; i < tmp; i++) {
			int r = in.nextInt();
			int sc = in.nextInt();
			int ec = in.nextInt();

			minX = Math.min(r, minX);
			maxX = Math.max(r, maxX);
			minY = Math.min(minY, Math.min(sc, ec));
			maxY = Math.max(maxY, Math.max(sc, ec));

			Pair p = new Pair(sc, ec);
			if(map.get(r) == null) {map.put(r, new Vector<Pair>());}
			map.get(r).add(p);
		}


		// BFS  
		TreeSet<Pair> vis = new TreeSet();
		ArrayDeque<Triple> q = new ArrayDeque();
		q.offer(new Triple(sx, sy, 0));
		int ans = -1;
		while(!q.isEmpty()) {
			Triple t = q.poll();
			if(vis.contains(new Pair(t.f, t.s))) continue;
			vis.add(new Pair(t.f, t.s));

			int x = t.f;
			int y = t.s;

			if(x == ex && y == ey) {
				ans = t.t;
				break;
			}


			for(int i = -1; i <= 1; i++) {
				for(int j = -1; j <= 1; j++) {
					if(i == 0 && j == 0) continue;
					int xx = x+i;
					int yy = y+j;

					if(xx < minX || xx > maxX || y < minY || y > maxY) continue;		// invalid Cell
					// check if cell is allowed 
					if(map.get(xx) == null) continue;
					for(Pair p : map.get(xx)) {
						if(p.include(yy)) {
							q.push(new Triple(xx, yy, t.t+1));
							break;
						}
					}
				}
			}

		}

		System.out.println(ans);

	}
}


class Pair implements Comparable<Pair>{
	int f, s;
	public Pair(int f, int s) {
		this.f = Math.min(f, s);
		this.s = Math.max(f ,s);
	}


	public boolean include(int y) {
			if(y >= f && y <= s) return true;
			return false;
	}

	@Override
	public boolean equals(Object o) {
		Pair p = (Pair) o;
		if(this.f == p.f && this.s == p.s) return true;
		return false;
	}

	@Override
	public int compareTo(Pair p) {
		if(this.f != p.f) return this.f  - p.f;
		return this.s - p.s;
	}

}

class Triple {
	int f, s, t;

	public Triple(int f, int s, int t) {
		this.f = f;
		this.s = s;
		this.t = t;
	}
}