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: I = input().split()
  a = [int(x) for x in I]
  ans = 10**20
  for i in range(0, 2):
      for j in range(i + 1, 3):
          s = a[i] * a[j]
          k = 3 - (i + j)
          A = s * ((a[k] + 1) // 2)
          B = s * ((a[k]) // 2)
          ans = min(ans, A - B)
  print(ans)
  
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)"}]