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;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();
        int c = sc.nextInt();

        int i = 0;
        int x, y, z;
        if (a % 2 == 0 && b % 2 == 0 && c % 2 == 0) {
            while(true){
                if(a == b && b == c && c == a){
                    System.out.print(-1);
                    break;
                }
                else if(a % 2 != 0 || b % 2 != 0 || c % 2 != 0){
                    System.out.print(i);
                    break;
                }
                else{
                    x = a / 2;
                    y = b / 2;
                    z = c / 2;

                    a = y + z;
                    b = x + z;
                    c = x + y;

                    i++;
                }
            }
        }
        else{
            System.out.print(i);
        }
    }
}