output_description: Print the minimum possible difference between the number of red blocks and the
  number of blue blocks.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: s = sorted(list(map(int, input().split())))
  a = s.pop(-1)
  b, c = a // 2, a - (a // 2)
  d = s[0] * a[1]
  print(abs(d * b - d * c))
  
problem_description: Statement
  
  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.
samples: [{"input": "3 3 3", "output": "9\n    \n\nFor example, Snuke can paint the blocks as shown in the diagram below. There\nare 9 red blocks and 18 blue blocks, thus the difference is 9.\n\n![](/img/agc/004/gatbantar/A_1.png)\n\n* * *"}, {"input": "2 2 4", "output": "0\n    \n\nFor example, Snuke can paint the blocks as shown in the diagram below. There\nare 8 red blocks and 8 blue blocks, thus the difference is 0.\n\n![](/img/agc/004/gatbantar/A_2.png)\n\n* * *"}, {"input": "5 3 5", "output": "15\n    \n\nFor example, Snuke can paint the blocks as shown in the diagram below. There\nare 45 red blocks and 30 blue blocks, thus the difference is 9.\n\n![](/img/agc/004/gatbantar/A_3.png)"}]