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

class Main{
  public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);

    int[] arr =  new int[] {
      scan.nextInt(),
      scan.nextInt(),
      scan.nextInt()
    };

    int maxIndex = -1;
    int maxKisu = -1;
    int kisuCount = 0;
    for(int i = 0; i < 3; i++) {
      if(arr[i]%2==1) {
        kisuCount++;
        if(arr[i] > maxKisu) {
          maxKisu = arr[i];
          maxIndex = i;
        }
      }
    }

    if(kisuCount < 3) {
      System.out.println(0);
    }
    else{
      long result = 1L;
      for(int i = 0; i < 3; i++) {
        if(i!=maxIndex) {
          result *= arr[i];
        }
      }
      System.out.println(result);
    }
  }
}
