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: def noofrupees(x, y, z):
      if x == y and x == z:
          return 0
      elif x == y:
          if x < z:
              return z - x
          else:
              if x % 2 == 0 and z % 2 == 0:
                  return int((x - z) / 2)
              elif x % 2 != 0 and z % 2 != 0:
                  return int((x - z) / 2)
              else:
                  z = z - 1
                  return int((x - z) / 2) + 1
      elif x == z:
          if x < y:
              return y - x
          else:
              if x % 2 == 0 and y % 2 == 0:
                  return int((x - y) / 2)
              elif x % 2 != 0 and y % 2 != 0:
                  return int((x - y) / 2)
              else:
                  y = y - 1
                  return int((x - y) / 2) + 1
      elif y == z:
          if y < x:
              return x - y
          else:
              if y % 2 == 0 and x % 2 == 0:
                  return int((y - x) / 2)
              elif y % 2 != 0 and x % 2 != 0:
                  return int((y - x) / 2)
              else:
                  x = x - 1
                  return int((y - x) / 2) + 1
  
  
  # t= int(input())
  t = 1
  for v in range(t):
      x, y, z = map(int, input().split())
      if x != y and x != z and y != z:
          list1 = [x, y, z]
          list1.sort()
          s = list1[2] - list1[1]
          list1[0] += s
          list1[1] += s
          print(s + noofrupees(list1[0], list1[1], list1[2]))
      else:
          print(noofrupees(x, y, z))
  
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"}]