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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.concurrent.LinkedBlockingQueue;


public class Main {

	/**
	 * @param args
	 * @throws IOException 
	 * @throws InterruptedException 
	 */
	public static void main(String[] args) throws IOException, InterruptedException {
		// TODO Auto-generated method stub
		 BufferedReader sc = new BufferedReader (new InputStreamReader(System.in));  
		 while(true)
		 {
			 String tmps = sc.readLine();
			 if(tmps==null)break;
			 String s[] = tmps.split(" ");
			 Point begin = new Point(Integer.valueOf(s[0]),Integer.valueOf(s[1]));
			 Point end = new Point(Integer.valueOf(s[2]),Integer.valueOf(s[3])); 
			 int n = Integer.valueOf(sc.readLine());
			 HashMap<Integer,HashSet<edge>> map = new HashMap<Integer,HashSet<edge>> ();
			 HashSet<edge> tmpEdge = new HashSet<edge>();
			 edge ende = new edge(end.x,end.y,end.y);
			 tmpEdge.add(ende);
			 map.put(end.x, tmpEdge);
			 for(int i=0;i<n;i++)
			 {
				 s = sc.readLine().split(" ");
				 int tmpx = Integer.valueOf(s[0]);
				 int tmpBegin = Integer.valueOf(s[1]);
				 int tmpEnd = Integer.valueOf(s[2]);
				 
				 tmpEdge = map.get(tmpx);
				 if(tmpEdge==null)
				 {
					 tmpEdge = new HashSet<edge>();
					 tmpEdge.add(new edge(tmpx,tmpBegin,tmpEnd));
					 map.put(tmpx, tmpEdge);
					 
				 }else{
					 tmpEdge.add(new edge(tmpx,tmpBegin,tmpEnd));
					 map.put(tmpx, tmpEdge);
				 }
			 }
			HashMap<edge,Long> stu = new HashMap<edge,Long>();
			LinkedBlockingQueue<Node> q = new LinkedBlockingQueue<Node>();
			q.put(new Node(new edge(begin.x,begin.y,begin.y),0,null));
			boolean flag = false;
			Node EndNode = null;
			 while(!q.isEmpty())
			 {
				 Node tmpNode = q.poll();
				 if(tmpNode.E==ende)
				 {
					 flag = true;
					 EndNode = tmpNode;
					 break;
				 }
				 HashSet<edge> lastx = map.get(tmpNode.E.x-1);
				 HashSet<edge> curx = map.get(tmpNode.E.x);
				 HashSet<edge> nextx = map.get(tmpNode.E.x+1);
				 if(lastx!=null)
				 {
					 Iterator<edge> lastit= lastx.iterator();
					 while(lastit.hasNext())
					 {
						 edge tmpE= lastit.next();
						 if(isOK(tmpNode.E,tmpE))
						 {
							 Long prestep = stu.get(tmpE);
							 if(prestep==null || prestep>tmpNode.step+1)
							 {
								 Node nextNode = new Node(tmpE,tmpNode.step+1,tmpNode);
								 q.put(nextNode);
								 stu.put(tmpE, nextNode.step);
							 }
						 }
					 }
				 }
				 
				 if(curx!=null)
				 {
					 Iterator<edge> curit= curx.iterator();
					 while(curit.hasNext())
					 {
						 edge tmpE= curit.next();
						 if(isOK(tmpNode.E,tmpE))
						 {
							 Long prestep = stu.get(tmpE);
							 if(prestep==null || prestep>tmpNode.step+1)
							 {
								 Node nextNode = new Node(tmpE,tmpNode.step+1,tmpNode);
								 q.put(nextNode);
								 stu.put(tmpE, nextNode.step);
							 }
						 }
					 }
				 }
				 if(nextx!=null)
				 {
					 Iterator<edge> nextit= nextx.iterator();
					 while(nextit.hasNext())
					 {
						 edge tmpE= nextit.next();
						 if(isOK(tmpNode.E,tmpE))
						 {
							 Long prestep = stu.get(tmpE);
							 if(prestep==null || prestep>tmpNode.step+1)
							 {
								 Node nextNode = new Node(tmpE,tmpNode.step+1,tmpNode);
								 q.put(nextNode);
								 stu.put(tmpE, nextNode.step);
							 }
						 }
					 }
				 }

			 }
			if(flag)
			{
				Node curNode = EndNode ;
				Point curp = end;
				long ret = 0;
				
				while(curNode.last!=null)
				{
					//System.out.println(curNode.E.begin +" "+curNode.E.end+" "+curNode.E.x);
					Node lastNode = curNode.last;
					ret=ret+addstep(curp,lastNode.E);
					curNode=lastNode;
				}
				System.out.println(ret);
			}else{
				System.out.println(-1);
			}
			 
		 }
	}
	public static boolean  isOK(edge e1,edge e2)
	{
		//left
		if(e1.begin-1>e2.end)return false;
		else if(e1.end+1<e2.begin)return false;
		return true;
	}
	public static int addstep(Point curp,edge nexte)
	{
		if(curp.y>=nexte.begin && curp.y<=nexte.end)
		{
			if(curp.x == nexte.x)
			return 0;
			else
			{
				curp.x = nexte.x;
				curp.note=true;
				return 1;	
			}
			
		}else{
			int ret = 0;
			if(nexte.begin>curp.y)
			{
				ret = nexte.begin-curp.y;
				curp.x = nexte.x;
				curp.y = nexte.begin;
			}else{
				ret = curp.y - nexte.end;
				curp.x = nexte.x;
				curp.y = nexte.end;
			}
			if(ret>1 && curp.note){ret=ret-1;curp.note=false;}
			return ret;
		}
		
		
		
	}
	
}
class edge{
	int x;
	int begin;
	int end;
	edge(int x,int begin,int end){this.x=x;this.begin=begin;this.end=end;}
}
class Point
{
	int x,y;
	boolean note;
	Point(int x,int y){this.x=x;this.y=y;}
}
class Node{
	edge E;
	long step;
	Node last;
	Node(edge E,long step,Node last){this.E=E;this.step=step;this. last=last;}
}
   	  	  	 		 				  	    	 			