output_description: Print the number of times the action will be performed by the three people, if
  this number is finite. If it is infinite, print `-1` instead.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: from enum import Enum
  
  
  class Judge(Enum):
      OK = 1
      END_ODD = 2
      END_INF = 3
  
  
  def judge_cookie(X):
      if X % 2 == 0:
          result = True
      else:
          result = False
  
      return result
  
  
  def devide_cookie(X):
      return X // 2
  
  
  def exchange_cookie(A, B, C):
      if judge_cookie(A) and judge_cookie(B) and judge_cookie(C):
          # OK
          AA = devide_cookie(B) + devide_cookie(C)
          BB = devide_cookie(A) + devide_cookie(C)
          CC = devide_cookie(A) + devide_cookie(B)
  
          if A == AA and B == BB and C == CC:
              result = Judge.END_INF
          else:
              result = Judge.OK
  
      else:
          # NG
          AA = BB = CC = 0
          result = Judge.END_ODD
  
      return result, AA, BB, CC
  
  
  A, B, C = map(int, input().split())
  
  Count = 0
  while True:
      J, AA, BB, CC = exchange_cookie(A, B, C)
      if J == Judge.OK:
          Count += 1
          A = AA
          B = BB
          C = CC
      elif J == Judge.END_INF:
          Ans = -1
          break
      else:
          Ans = Count
          break
  
  print(Ans)
  
problem_description: Statement
  
  Takahashi, Aoki and Snuke love cookies. They have A, B and C cookies,
  respectively. Now, they will exchange those cookies by repeating the action
  below:
  
    * Each person simultaneously divides his cookies in half and gives one half to each of the other two persons.
  
  This action will be repeated until there is a person with odd number of
  cookies in hand.
  
  How many times will they repeat this action? Note that the answer may not be
  finite.
samples: [{"input": "4 12 20", "output": "3\n    \n\nInitially, Takahashi, Aoki and Snuke have 4, 12 and 20 cookies. Then,\n\n  * After the first action, they have 16, 12 and 8.\n  * After the second action, they have 10, 12 and 14.\n  * After the third action, they have 13, 12 and 11.\n\nNow, Takahashi and Snuke have odd number of cookies, and therefore the answer\nis 3.\n\n* * *"}, {"input": "14 14 14", "output": "-1\n    \n\n* * *"}, {"input": "454 414 444", "output": "1"}]