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
#!/usr/bin/env python

from sys import stdin, stderr

def cut(A, p):
   v1 = 1
   v2 = 1
   for i in xrange(len(A)):
      if i == p:
         v1 *= A[i]/2
         v2 *= A[i] - A[i]/2
      else:
         v1 *= A[i]
         v2 *= A[i]
   return abs(v2-v1)

def main():
   A = map(int, stdin.readline().split())
   res = min(cut(A, 0), cut(A, 1), cut(A, 2))
   print res
   return 0

if __name__ == '__main__': main()
