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
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
		//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		int[] sides = new int[3];
		sides[0] = sc.nextInt();
		sides[1] = sc.nextInt();
		sides[2] = sc.nextInt();
		
		//check if even num
		if((sides[0]%2) == 0 || (sides[1]%2) == 0 || (sides[2]%2) == 0){
			System.out.println(0);
		}
		else{
			//all sides odd
			Arrays.sort(sides);
			long l = sides[0];
			l *= sides[1];
			System.out.println(l);
		}
	}
}