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

//package CodeForces;

import java.awt.Point;
import java.io.*;
import java.util.*;

public class Problem_242C {
	static HashSet<Point>hs;
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner();
		PrintWriter pw = new PrintWriter(System.out);
		hs=new HashSet<>();
		Point start=new Point(sc.nextInt(), sc.nextInt());
		Point finish=new Point(sc.nextInt(), sc.nextInt());
		int n=sc.nextInt();
		while(n-->0)
		{
			int x=sc.nextInt(),s=sc.nextInt(),e=sc.nextInt();
			for(int i=s;i<=e;i++)
				hs.add(new Point(x, i));
		}
		pw.println(dijkstra_grid(start, finish));
		pw.close();
	}
	public static boolean valid(int i,int j)
	{
		return i<=(int)1e9 && i>=0 && j<=(int)1e9 && j>=0;		
	}
	public static int dijkstra_grid(Point s,Point e)
	{
		Queue<Point>q=new LinkedList<>();
		int[] dx= {-1,1,0,0,1,-1,-1,1};
		int[] dy= {0,0,-1,1,1,-1,1,-1};
		HashMap<Point, Integer>dist=new HashMap<>();
//		for(int []a:dist)
//			Arrays.fill(a, (int)1e9);
//		dist[i][j]=0;
		q.add(s);
		dist.put(s, 0);
		while(!q.isEmpty())
		{
			Point cur=q.poll();
			int ci=cur.x,cj=cur.y;
			for(int k=0;k<8;k++)
			{
				int x=ci+dx[k],y=cj+dy[k];
				Point nxt=new Point(x, y);
				if(valid(x,y)&& hs.contains(nxt) && dist.get(cur)+1<dist.getOrDefault(nxt,(int)1e9))//we are not checking about visited we check if it is block
				{
					q.add(nxt);
					dist.put(nxt, dist.get(cur)+1);
//					qi.add(x);
//					qj.add(y);
//					grid[x][y]='X';
//					dist[x][y]=dist[ci][cj]+1;
				}
			}
//			System.out.println(dist);
		}
		return dist.getOrDefault(e, -1);
	}
	static class Graph
	{
		char[][]grid;
		boolean[]visited;
		int size;
		@SuppressWarnings("unchecked")
		public Graph(int size)
		{
			this.size=size;
			grid=new char[size][size];
			for(int i=0;i<size;i++)
				Arrays.fill(grid[i], 'X');
			visited=new boolean[size];
		}
		public void add(int r,int s,int e)
		{
			for(int i=s;i<=e;i++)
				grid[r][i]='.';
		}
		//Float_Fill
		public void dfs2(int i,int j)
		{ 
			int[] dx= {-1,1,0,0,1,-1,-1,1};
			int[] dy= {0,0,-1,1,1,-1,1,-1};
			grid[i][j]='X';// Visited
			for(int k=0;k<4;k++)
			{
				int x=i+dx[k],y=j+dy[k];
				if(valid(x,y)&&grid[x][y]!='X')
					dfs2(x,y);
			}
				
		}
		public boolean valid(int i,int j)
		{
			return i<size && i>=0 && j<size && j>=0;		
		}
		public int dijkstra_grid(int i,int j,int end_i,int end_j)
		{
			Queue<Integer>qi=new LinkedList<>(),qj=new LinkedList<>();
			qi.add(i);qj.add(j);
			grid[i][j]='X';
			int[] dx= {-1,1,0,0,1,-1,-1,1};
			int[] dy= {0,0,-1,1,1,-1,1,-1};
			int dist[][]=new int[size][size];
			for(int []a:dist)
				Arrays.fill(a, (int)1e9);
			dist[i][j]=0;
			while(!qi.isEmpty())
			{
				int ci=qi.poll(),cj=qj.poll();
				for(int k=0;k<4;k++)
				{
					int x=ci+dx[k],y=cj+dy[k];
					if(valid(x,y)&& grid[x][y]!='X' && dist[ci][cj]+1<dist[x][y])//we are not checking about visited we check if it is block
					{
						qi.add(x);
						qj.add(y);
//						grid[x][y]='X';
						dist[x][y]=dist[ci][cj]+1;
					}
				}
			}
			return dist[end_i][end_j];
//			for(int[]a:dist)
////				System.out.println(Arrays.toString(a));
//				printRow(a);
		}
	}
	static class Scanner {
		BufferedReader br;
		StringTokenizer st;

		Scanner() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() throws IOException {
			while (st == null || !st.hasMoreTokens()) {
				st = new StringTokenizer(br.readLine());
			}
			return st.nextToken();
		}

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

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

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

		String nextLine() throws IOException {
			return br.readLine();
		}

		boolean hasnext() throws IOException {
			return br.ready();
		}

	}
}
