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.Map;
import java.io.IOException;
import java.util.HashMap;
import java.util.Set;
import java.io.OutputStream;
import java.io.PrintWriter;
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
 */
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 {

    Set<Long> allowed;
    Map<Long, Integer> distance;

    int[] dx = new int[]{-1,-1,-1,0,0,1,1,1};
    int[] dy = new int[]{-1,0,1,-1,1,-1,0,1};


    public void solve(int testNumber, InputReader jin, PrintWriter jout) {
        int x0 = jin.int32();
        int y0 = jin.int32();

        int x1 = jin.int32();
        int y1 = jin.int32();

        long start = convertToLong(x0, y0);
        long target = convertToLong(x1, y1);

        allowed = new HashSet<Long>();
        distance = new HashMap<Long, Integer>();

        int n = jin.int32();
        for(int i = 0; i < n; i++) {
            int row = jin.int32();
            int cols = jin.int32();
            int cole = jin.int32();
            for(int j = cols; j <= cole; j++) {
                allowed.add(convertToLong(row, j));
            }
        }

        Queue<Long> que = new LinkedList<Long>();
        que.add(start);
        distance.put(start, 0);
        while(!que.isEmpty()) {
            long curr = que.poll();
            if(curr == target) {
                break;
            }
            int[] coords = convertToIntArr(curr);
            for(int k = 0; k < dx.length; k++) {
                int nx = coords[0] + dx[k];
                int ny = coords[1] + dy[k];

                long np = convertToLong(nx, ny);
                if(!allowed.contains(np)) continue;
                if(distance.containsKey(np)) continue;
                que.add(np);
                distance.put(np, distance.get(curr) + 1);
            }
        }

        if(distance.containsKey(target)) {
            jout.println(distance.get(target));
        } else {
            jout.println(-1);
        }

    }

    private int[] convertToIntArr(long curr) {
        long mask = (1L << 32) - 1;
        int ny = (int)(curr & mask);
        int nx = (int)((curr >> 32) & mask);
        return new int[]{nx, ny};
    }

    private long convertToLong(int nx, int ny) {
        return ((1L * nx) << 32) | ny;
    }
}

class InputReader {
    private static final int bufferMaxLength = 1024;
    private InputStream in;
    private byte[] buffer;
    private int currentBufferSize;
    private int currentBufferTop;
    private static final String tokenizers = " \t\r\f\n";

    public InputReader(InputStream stream) {
        this.in = stream;
        buffer = new byte[bufferMaxLength];
        currentBufferSize = 0;
        currentBufferTop = 0;
    }

    private boolean refill() {
        try {
            this.currentBufferSize = this.in.read(this.buffer);
            this.currentBufferTop = 0;
        } catch(Exception e) {}
        return this.currentBufferSize > 0;
    }

    public String line() {
        StringBuffer tok = new StringBuffer();
        Byte first;
        while((first = readChar()) != null) {
            tok.append((char)first.byteValue());
            if((char)first.byteValue() == '\n')
                break;
        }
        return tok.toString();
    }

    public Byte readChar() {
        if(currentBufferTop < currentBufferSize) {
            return this.buffer[this.currentBufferTop++];
        } else {
            if(!this.refill()) {
                return null;
            } else {
                return readChar();
            }
        }
    }

    public String token()  {
        StringBuffer tok = new StringBuffer();
        Byte first;
        while((first = readChar()) != null && (tokenizers.indexOf((char) first.byteValue()) != -1));
        if(first == null) return null;
        tok.append((char)first.byteValue());
        while((first = readChar()) != null && (tokenizers.indexOf((char) first.byteValue()) == -1)) {
            tok.append((char)first.byteValue());
        }
        return tok.toString();
    }


    public String next() {
        return token();
    }

    public Integer int32() throws NumberFormatException {
        String tok = token();
        return tok == null? null : Integer.parseInt(tok);
    }

    public Long int64() throws NumberFormatException {
        String tok = token();
        return tok == null? null : Long.parseLong(tok);
    }
}

