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
#include <cstdio>

int A, B, C;
int A2, B2, C2;

void solve()
{
	int i;
	for(i=0; i<100000000; i++){
		if(A%2==1 || B%2==1 || C%2==1)
			break;
		A2 = (B+C)/2;
		B2 = (A+C)/2;
		C2 = (A+B)/2;
		A = A2;
		B = B2;
		C = C2;
	}
	if(i == 100000000)
		printf("-1\n");
	else
		printf("%d\n", i);
}

int main()
{
	scanf("%d%d%d", &A, &B, &C);
	solve();
	return 0;
}