Problem Statement

The Manhattan distance between points $(x_1,y_1)$ and $(x_2,y_2)$ is expressed as $|\,x_1-x_2|+|\,y_1-y_2|$.
You are given the bottom-left coordinates $(x_1,y_1)$ and the top-right coordinates $(x_2,y_2)$ of a rectangle.
Find how many lattice points whose Manhattan distance from $(0,0)$ is at most $d$ lie within the closed region of the rectangle enclosed by the four points $(x_1,y_1), (x_2,y_1), (x_2,y_2), (x_1,y_2)$.

Input

$x_1 \ y_1 \ x_2 \ y_2 \ d$

The bottom-left coordinates $(x_1,y_1)$ of the rectangle, the top-right coordinates $(x_2,y_2)$ of the rectangle, and the Manhattan distance $d$ are given, separated by spaces.
All inputs are integers.
$-10^9 \le x_1 \lt x_2 \le 10^9$
$-10^9 \le y_1 \lt y_2 \le 10^9$
$0 \le d \le 2 \times 10^9$

Output

Output the number of lattice points within the region whose Manhattan distance from $(0,0)$ is at most $d$.

Sample

0 0 3 3 3

10

-3 -3 0 0 2

6

1 1 3 3 3

3