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.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
import java.util.TreeSet;
public class Main{ 
	static final int INF = 1000000000;
	static int []dx = {0,0,-1,1,1,1,-1,-1};
	static int []dy=  {1,-1,0,0,1,-1,1,-1};
	static int c;
    static int x;
    static int y;
    static int x1;
    static int y1;
    static TreeSet <cell>allcells =new TreeSet();  // allowed cells
	public static void main(String[] args) throws IOException{
		PrintWriter pw=new PrintWriter(System.out);
		Scanner sc=new Scanner(System.in);
		//initial position
		x=sc.nextInt();
		y=sc.nextInt();
		//final position
    	x1=sc.nextInt();
	    y1=sc.nextInt();
	    //segments
		int s=sc.nextInt();
		c=0;
		for(int i=0;i<s;i++){ // inputting allowed cells
			int row=sc.nextInt();
			int a=sc.nextInt();
			int b=sc.nextInt();		
			for(int j=a;j<=b;j++){
				if(!allcells.contains(new cell(row,j,-1))){ // if doesn't exist
					cell p=new cell(row,j,-1); //make one
				    allcells.add(p);
				}
			}
		}
//		System.out.println(allcells);
	    
	    pw.println(bfs());
	    pw.flush();

	}

public static int bfs() {
	Queue <cell>q=new LinkedList<>();
	q.add(new cell(x,y,0));
	TreeSet<cell> visited=new TreeSet();
	visited.add(new cell(x,y,0));
	int c=0;
	while(!q.isEmpty()) {
//		System.out.println(q);
		if(c>60)
			break;
		c++;
		cell curr=q.poll();
		int j=curr.c;
	    int i=curr.r;
	    int cost=curr.distance;
	    for(int z=0;z<8;z++) {
	    	
			if(valid(i+dx[z],j+dy[z])&& !visited.contains(new cell(i+dx[z],j+dy[z],cost+1))) {
		        q.add(new cell(i+dx[z],j+dy[z],cost+1));
			    visited.add(new cell(i+dx[z],j+dy[z],cost+1));
			}
	    	if(i+dx[z]==x1&& y1==j+dy[z]) {
		    	return cost+1;
		    }
		}
	    
	
	}
	return -1;
}

public static boolean valid(int a,int b){
	if(a>=0 && b>=0 && a<=INF && b<=INF && allcells.contains(new cell(a,b,-1))) //on grid and allowed cell
			return true; 
	return false;
}


static class cell implements Comparable<cell>{
      int r;
	  int c;
	  int distance;
	  
	  public cell(int row,int col,int dis){
		  r=row;
		  c=col;
		  distance=dis;
	  }
	  public int compareTo(cell o) {
		   if(r!=o.r)
			   return r-o.r;
		   else return c-o.c;
	  }
	 public String toString() {
		 return r+" "+c+" "+distance;
				 
	 }
  }

static class Scanner 
{
    StringTokenizer st;
    BufferedReader br;

    public Scanner(InputStream s){    br = new BufferedReader(new InputStreamReader(s));}

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

    public int nextInt() throws IOException {return Integer.parseInt(next());}
    
    public long nextLong() throws IOException {return Long.parseLong(next());}

    public String nextLine() throws IOException {return br.readLine();}
    
    public double nextDouble() throws IOException
    {
        String x = next();
        StringBuilder sb = new StringBuilder("0");
        double res = 0, f = 1;
        boolean dec = false, neg = false;
        int start = 0;
        if(x.charAt(0) == '-')
        {
            neg = true;
            start++;
        }
        for(int i = start; i < x.length(); i++)
            if(x.charAt(i) == '.')
            {
                res = Long.parseLong(sb.toString());
                sb = new StringBuilder("0");
                dec = true;
            }
            else
            {
                sb.append(x.charAt(i));
                if(dec)
                    f *= 10;
            }
        res += Long.parseLong(sb.toString()) / f;
        return res * (neg?-1:1);
    }
    public boolean ready() throws IOException {return br.ready();}


}
}
