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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

class Main{
	public static void main(String args[]) throws IOException{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String po[] = br.readLine().split(" ",0);
		long[] d = new long[3];
		for(int i = 0; i < 3; i++){
			d[i] = Long.parseLong(po[i]);
		}
		if(d[0]%2 == 0 || d[1]%2 == 0 || d[2]%2 ==  0){
			System.out.println("0");
		}else if(d[0] > d[1]){
			if(d[0] > d[2]){
				System.out.println(d[1]*d[2]);
			} else {
				System.out.println(d[1]*d[0]);	
			}
		} else {
			if(d[1] > d[2]) {
				System.out.println(d[0]*d[2]);
			} else {
				System.out.println(d[0]*d[1]);
			}
		}
	}
}