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.*;

public class Main {
    
    public static void main(String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] in1 = br.readLine().split(" ");
        //int N = Integer.parseInt(br.readLine());
        long A = Long.parseLong(in1[0]);
        long B = Long.parseLong(in1[1]);
        long C = Long.parseLong(in1[2]);
        br.close();

        long ans = 0L;
        if(A%2 != 0 && B%2 != 0 && C%2 != 0){
            ans = Math.min(A * B, B * C);
            ans = Math.min(ans, C * A);
        }

        System.out.println(ans);
    }
}