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
a,b,c=map(int,raw_input().split())
if a%2==1 or b%2==1 or c%2==1:
    print 0
    exit()
if a==b==c:
    print -1
    exit()
tmpa=0;tmpb=0;tmpc=0;
ans=0
while 1:
    tmpa=b/2+c/2
    tmpb=a/2+c/2
    tmpc=a/2+b/2
    ans+=1
    if tmpa%2==1 or tmpb%2==1 or tmpc%2==1:
        break
    if tmpa==tmpb==tmpc:
        break
    a=tmpa;b=tmpb;c=tmpc;
print ans
