OGRLICA

문제

Luka had recently bought an expensive gold collar for his dog, and took him for a walk in the park. Entering the park Luka let the dog off the chain and went to the exit using one of the fastest path. His dog caught up with him exactly T seconds after Luka has reached the exit. However, Luka was very unhappy when he realized that his dog lost his collar. Now, he is interested in which park area his dog could lose the necklace. 

Park can be represented as a two-dimensional plane, while Luka and a dog as points in it. At the moment when the dog is set loose, they were at the same coordinates (Ax, Ay). Luka and the dog can move through the park only in 4 main directions (up, down, left and right) at speed of exactly 1 meterper second. They can move independently and are able to arbitrarily change the direction of movement during one second. For example, it is possible that one of them moves 0.37 meters up and then continues 0.63 meters to the right while other moves 1 meter to the left during one second. 

Exactly T seconds after Luka came through one of the fastest way to the exit, the dog caught up with him and once again they were at the same coordinates (Bx, By). Also in the park, there are rectangularfence enclosed gardens through which neither Luka nor the dog can move. These gardens are represented as rectangles in the plane that do not touch or intersect each other. Luka and the dog are able to move by the edges of the gardens. 

Note: it is possible that the dog stood for a while in one place. Luka, before he reached the exit, was constantly moving at a speed of exactly 1 meter per second. 

입력

First line of input contains integer N (0 ≤ N ≤ 100), which represents number of gardens inside the park. 

Second line contains two integers Ax and Ay (0 ≤ Ax, Ay ≤ 10000), coordinates where Luka and the dog are entering the park. 

Third line contains two integers Bx and By (0 ≤ Bx, By ≤ 10000), coordinates of exit of the park. These coordinates will allways be different than coordinates of park entering (Ax, Ay). 

In next N lines there will be four integers X1, Y1, X2, Y2 (0 ≤ X1 < X2 ≤ 10000, 0 ≤ Y1 < Y2 ≤ 10000), where (X1, Y1) defines lower-left, and (X2, Y2) upper-right corner of garden. These rectangleswill not contain or touch park entering or park exit 

Last line of input contains integer T (0 ≤ T ≤ 10000), number of seconds Luka waited for his dog at the park exit. 

출력

First and only line of output has to contain area of the park where the dog could have lost the necklace.

Solution will be accepted if apsolute error is at most 0.01. 

2
1 1
5 5
2 2 3 6
4 3 7 4
0

7.000000

0
1 1
5 5
2

34.000000