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
import sys
from collections import deque
import copy


def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline

def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [A, B, C] = [int(input_raw[0]), int(input_raw[1]), int(input_raw[2])]
    A_arr = [A, (B + C)/2]
    B_arr = [B, (A + C)/2]
    C_arr = [C, (B + A)/2]
    i = 0
    if A % 2 == 1 or B % 2 == 1 or C % 2 == 1:
        print 0
        exit()
    if (B + C) % 2 == 1 or (A + C) % 2 == 1 or (B + A) % 2 == 1:
        print 1
        exit()
    if A_arr[0] == A_arr[1] and B_arr[0] == B_arr[1] and C_arr[0] == C_arr[1]:
        print -1
        exit()

    while 1:
        if i >= 2:
            A_arr.append((A_arr[i - 1] + A_arr[i - 2])/2)
            B_arr.append((B_arr[i - 1] + B_arr[i - 2])/2)
            C_arr.append((C_arr[i - 1] + C_arr[i - 2])/2)
        if A_arr[i] % 2 == 1 or B_arr[i] % 2 == 1 or C_arr[i] % 2 == 1:
            break;

        i += 1
    print i
if __name__ == '__main__':
    main()
