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

		// input
		int a = scan.nextInt();
		int b = scan.nextInt();
		int c = scan.nextInt();

		// check
		int count = 0;
		while(true){
			if(count >= 1000000) {
				count = -1;
				break;
			}
			if(a % 2 != 0 | b % 2 != 0 | c % 2 != 0){
				break;
			}
			int tempA = a / 2;
			int tempB = b / 2;
			int tempC = c / 2;
			a = tempB + tempC;
			b = tempA + tempC;
			c = tempA + tempB;
			count++;
		}

		// answer
		System.out.println(count);

	}
}

