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,_a,_b,_c;
int main(){
	scanf("%d%d%d",&a,&b,&c); 
	int t=0;
	while (!(a&1)  && !(b&1) && !(c&1)){
		t++; _a=(b+c)>>1; _b=(a+c)>>1; _c=(a+b)>>1;
		if (a==_a && b==_b && c==_c) {
			puts("-1");
			return 0;
		}
		a=_a; b=_b; c=_c;
		
	}
	printf("%d\n",t);
	return 0;
} 