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 java.util.Scanner;

/**
 * Created by zzt on 17-5-6.
 */
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int curA = scanner.nextInt();
        int curB = scanner.nextInt();
        int curC = scanner.nextInt();
        int time = 0;

        if (curA == curB && curA == curC && curA % 2 == 0) {
            System.out.println(-1);
            return;
        }
        int tempA = 0, tempB = 0, tempC = 0;
        while (curA % 2 == 0 && curB % 2 == 0 && curC % 2 == 0) {
            tempA = curB / 2 + curC / 2;
            tempB = curA / 2 + curC / 2;
            tempC = curA / 2 + curB / 2;
            curA = tempA;
            curB = tempB;
            curC = tempC;
            time++;
        }
        System.out.println(time);
    }
}