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();
        sc.close();

        if(a%2==1 || b%2 == 1 || c%2 == 1){
            System.out.print("0");
            return;
        }

        if(a==b && b== c){
            System.out.print("-1");
            return;
        }

        for(int i=1; i>0; i++){
            int ta = b/2 + c/2;
            int tb = a/2 + c/2;
            int tc = a/2 + b/2;
            a = ta;
            b = tb;
            c = tc;
            if(a%2==1 || b%2 == 1 || c%2 == 1){
                System.out.print(i);
                break;
            }
        }
	}
}
