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.

Constraints

* 1 ≤ A,B,C ≤ 10^9

Input

Input is given from Standard Input in the following format:


A B C


Output

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.

Examples

Input

4 12 20


Output

3


Input

14 14 14


Output

-1


Input

454 414 444


Output

1
cookies = map(int, raw_input().split())
count = 0
while cookies[0]%2 == 0 and cookies[1]%2 == 0 and cookies[2]%2 == 0:
  if cookies[0] == cookies[1] and cookies[0] == cookies[2]:
    count = -1
    break
  count += 1
  a = cookies[1]/2 + cookies[2]/2
  b = cookies[0]/2 + cookies[2]/2
  c = cookies[0]/2 + cookies[1]/2
  cookies = [a,b,c]
  #print cookies
print count