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.*;

public class Main{
        public static void main(String[] args){
                try(Scanner sc = new Scanner(System.in)){
                        long[] A = new long[3], B = new long[3];
                        for(int i = 0; i < 3; i++){
                                B[i] = sc.nextLong();
                                if(B[i] % 2 == 1) {
                                        System.out.println(0);
                                        return;
                                }
                        }
                        Arrays.sort(B);
                        Set<long[]> set = new HashSet<>();
                        long num = 0;
                        while(!Arrays.equals(A, B)){
                                num++;
                                A = Arrays.copyOf(B, B.length);
                                B[0] = (A[0] + A[1]) / 2;
                                B[1] = (A[1] + A[2]) / 2;
                                B[2] = (A[2] + A[0]) / 2;
                                if(B[0] % 2 == 1 || B[1] % 2 == 1 || B[2] % 2 == 1){
                                        System.out.println(num);
                                        return;
                                }
                                Arrays.sort(B);
                        }
                        System.out.println(-1);
                }
        }
}
