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
/* Filename: AGC004A.java
 * Author: Mushiyo
 */

import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);

		while (input.hasNext()) {
			int A = input.nextInt(), B = input.nextInt(), C = input.nextInt();

			if (A % 2 == 0 || B % 2 == 0 || C % 2 == 0) {
				System.out.println(0);
			} else {
				long AxB = (long) A * B;
				long BxC = (long) B * C;
				long AxC = (long) A * C;
				long minDiff = Math.min(AxB, Math.min(AxC, BxC));
				
				System.out.println(minDiff);
			}
		}
	}

}
