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) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in);

		long a[] = new long[3];

		for(int i = 0; i < 3; i++){
			a[i] = sc.nextInt();

			if(a[i] % 2 == 1){
				System.out.println(0);
				return;
			}
		}

//		Arrays.sort(a);

		if(a[2] == a[1] && a[1] == a[0]){
			System.out.println(-1);
			return;
		}

		int count = 0;

		while(true){
			if(a[0] % 2 == 1 || a[1] % 2 == 1 || a[2] % 2 == 1){
				break;
			}
			count++;

			long s = a[0];
			long t = a[1];
			long u = a[2];

			a[0] = (t + u)/2;
			a[1] = (s + u)/2;
			a[2] = (s + t)/2;
		}

		System.out.println(count);

	}
}
