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

def main():

    import sys, math
    #from bisect import bisect_left as bl, bisect_right as br, insort
    from heapq import heapify, heappush, heappop
    from collections import defaultdict as dd, deque, Counter
    #from itertools import permutations,combinations
    def data(): return sys.stdin.readline().strip()
    def mdata(): return list(map(int, data().split()))
    def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
    # sys.setrecursionlimit(100000)
    INF = int(1e9)
    mod = int(1e9)+7

    x0,y0,x1,y1=mdata()
    n=int(data())
    d=dd(int)
    for i in range(n):
        r,a,b=mdata()
        for i in range(a,b+1):
            d[(r,i)]=1
    if d[(x0,y0)]==0:
        print(-1)
        exit()

    dist = dd(int)
    for i in d:
        dist[i]=INF
    dist[(x0,y0)] = 0
    vis = dd(int)
    s = []
    heapify(s)
    heappush(s, (0, x0,y0))

    while len(s) != 0:
        wei, x,y = heappop(s)
        vis[(x,y)] = 1

        for i in [-1,0,1]:
            for j in [-1,0,1]:
                if i==j==0:
                    continue
                if d[(x+i,y+j)]==1:
                    if dist[(x,y)] + 1 < dist[(x+i,y+j)]:
                        dist[(x+i,y+j)] = dist[(x,y)] + 1
                        if vis[(x+i,y+j)] == 0:
                            heappush(s, (dist[(x+i,y+j)], x+i,y+j))
    if dist[x1,y1]==INF:
        print(-1)
    else:
        print(dist[x1,y1])


if __name__ == '__main__':
    main()
