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>

using namespace std;

int main()
{
	int a,b,c;
	scanf("%d%d%d",&a,&b,&c);
	int ans=0;
	for(int i=1;i<=10000000;i++)
	{
		if((a&1)||(b&1)||(c&1))break; 
		ans++;
		int t1=b/2+c/2,t2=a/2+c/2,t3=a/2+b/2;
		a=t1,b=t2,c=t3;
	}
	if(ans==1e7)printf("-1\n");
	else printf("%d\n",ans);
	return 0;
}