p04005 AtCoder Grand Contest 004 - Divide a Cuboid_16133
We have a rectangular parallelepiped of size A×B×C, built with blocks of size 1×1×1. Snuke will paint each of the A×B×C blocks either red or blue, so that:

* There is at least one red block and at least one blue block.
* The union of all red blocks forms a rectangular parallelepiped.
* The union of all blue blocks forms a rectangular parallelepiped.



Snuke wants to minimize the difference between the number of red blocks and the number of blue blocks. Find the minimum possible difference.

Constraints

* 2≤A,B,C≤10^9

Input

The input is given from Standard Input in the following format:


A B C


Output

Print the minimum possible difference between the number of red blocks and the number of blue blocks.

Examples

Input

3 3 3


Output

9


Input

2 2 4


Output

0


Input

5 3 5


Output

15
a,b,c = map(int, raw_input().split())
area = min((a*b, b*c, c*a))
# print area

if area == a*b:
    d = c
elif area == b*c:
    d = a
else:
    d = b

d1 = d/2
d2 = d - d1
print area * (d2 - d1)
