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 {
	static Scanner in = new Scanner(System.in);

	public static void main(String[] args) {
		int a = in.nextInt(), b = in.nextInt(), c = in.nextInt();
		if(a == b && b == c){
			if(a % 2 == 0){
				System.out.println("-1");
			}else{
				System.out.println("0");
			}
		}else{
			int i = 0;
			while(a %2 == 0 && b % 2 == 0 && c % 2 == 0){
				int ta, tb, tc;
				ta = (b + c) / 2;
				tb = (a + c) / 2;
				tc = (a + b) / 2;
				a = ta;
				b = tb;
				c = tc;
				i++;
			}
			System.out.println(i);
		}
	}
}
