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
# -*- encoding:utf-8 -*-

arr = map(int,  raw_input().split(" "))

def exchange(arr):
    result=[]
    harf=[i/2 for i in arr]
    for i in range(len(arr)):
        result.append(sum(harf)-harf[i])
        
    return result

def odd_check(arr):
    result=True
    for i in arr:
        if i%2==1:
            result=False
    return result


ans=0
loop=[]
while odd_check(arr):
    loop.append(arr[:])
    arr = exchange(arr)
    ans += 1
    if arr in loop:
        ans = -1
        break
        
print(ans)
