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.util.Scanner;

public class Main {
    public static void main(String args[] ) throws Exception {
    	new Main().exec(args);
    }

    public Main() {
    }

    private long[] ABC = new long[3];

    public void exec(String args[]) throws Exception {
    	//初期化読み込み
    	Scanner sc = new Scanner(System.in);
    	ABC[0] = sc.nextInt();
    	ABC[1] = sc.nextInt();
    	ABC[2] = sc.nextInt();
    	if(ABC[0] > ABC[1]) swap(0,1);
    	if(ABC[1] > ABC[2]) {
    		swap(1,2);
    		if(ABC[0] > ABC[1]) swap(0,1);
    	}
    	//System.out.println(ABC[0]+","+ABC[1]+","+ABC[2]);
    	if(ABC[0]%2==0 || ABC[1]%2==0 || ABC[2]%2==0) {
    		System.out.println("0");
    	}else{
    		System.out.println(ABC[0]*ABC[1]);
    	}
	}

    private void swap(int index1, int index2) {
		long temp=ABC[index1];
		ABC[index1]=ABC[index2];
		ABC[index2]=temp;
    }
}