output_description: Print the minimum number of operations required to make A, B and C all equal.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: L = list(map(int, input().split())).sort(reverse=True)
  m = (L[0] - L[1]) % 2 - (L[0] - L[2]) % 2
  if m == 0:
      print(L[0] + (-L[1] - L[2]) // 2)
  else:
      print(L[0] + (-L[1] - L[2] + 3) // 2)
  
problem_description: Statement
  
  You are given three integers A, B and C. Find the minimum number of operations
  required to make A, B and C all equal by repeatedly performing the following
  two kinds of operations in any order:
  
    * Choose two among A, B and C, then increase both by 1.
    * Choose one among A, B and C, then increase it by 2.
  
  It can be proved that we can always make A, B and C all equal by repeatedly
  performing these operations.
samples: [{"input": "2 5 4", "output": "2\n    \n\nWe can make A, B and C all equal by the following operations:\n\n  * Increase A and C by 1. Now, A, B, C are 3, 5, 5, respectively.\n  * Increase A by 2. Now, A, B, C are 5, 5, 5, respectively.\n\n* * *"}, {"input": "2 6 3", "output": "5\n    \n\n* * *"}, {"input": "31 41 5", "output": "23"}]