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) {
        Scanner sc = new Scanner(System.in);
        long [] ABC = {sc.nextLong(),sc.nextLong(),sc.nextLong()};
        Arrays.sort(ABC);
        long ans = 0;
        long sum = 0;
        String S = "";
        for(int i=0; i<3; i++){
            sum+=ABC[i];
            S+=(ABC[i]+" ");
        }
        HashSet<String> Set = new HashSet<>();
        Set.add(S);
        
        while(true){
            long x = ABC[0]/2;
            long y = ABC[1]/2;
            long z = ABC[2]/2;
            long [] nextABC = {x+y,y+z,z+x};
            Arrays.sort(nextABC);
            long tmpsum=0;
            String tmpS="";
            for(int i=0; i<3; i++){
                tmpsum+=nextABC[i];
                tmpS+=(nextABC[i]+" ");
                ABC[i] = nextABC[i];
            }
            if(Set.contains(tmpS)){
                System.out.println(-1);
                return;
            }else if(sum!=tmpsum){
                break;
            }
            Set.add(tmpS);
            ans++;
        }
        System.out.println(ans);
    }
}
