Triplets#5894

Triplets

1 second

64 megabytes

Very easy

Given three ranges of integers $[a, A]$ , $[b, B]$ , and $[c, C]$ , determine the total number of ordered triples of integers $(x, y, z)$ (x, y, z) that satisfy the following conditions:

$x \neq = y$ x \ne y
$x \neq = z$ x \ne z
$y \neq = z$ y \ne z
$a \leq x \leq A$ a \le x \le A
$b \leq y \leq B$ b \le y \le B
$c \leq z \leq C$ c \le z \le C

Input

The first line of the input contains the integer $N$ . The second line contains $N$ integers separated by spaces, representing the sequence $(a, A, b, B, c, C)$ (a, A, b, B, c, C), where $a \leq A$ a \le A, $b \leq B$ b \le B, $c \leq C$ c \le C, and $- 1 0^{3} \leq a, b, c, A, B, C \leq 1 0^{3}$ -10^3 \le a, b, c, A, B, C \le 10^3.

Output

Output a single line containing the answer to the problem.

Examples

Example 1