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

public class Main {
  public static void main(String args[]) {
    Scanner sc = new Scanner(System.in);
    long S[] = new long[3];
    S[0] = sc.nextLong();
    S[1] = sc.nextLong();
    S[2] = sc.nextLong();
    Arrays.sort(S);
    long s1 = (int)S[2] / 2 * S[1] * S[0];
    long sAll = S[0] * S[1] * S[2];
    long s2 = sAll - s1;
    System.out.print(s2 - s1);
  }
}