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<iostream>
#include<cstdio>
#include<cstring>
int f(int a,int b,int c)
{
	int ret=0;
	while(a%2==b%2 && b%2==c%2)ret++,a>>=1,b>>=1,c>>=1;
	return ret;
}
void solve()
{
	int x,y,z;
	scanf("%d%d%d",&x,&y,&z);
	if(x%2 || y%2 || z%2)printf("0\n");
	else if(x==y && y==z)printf("-1\n");
	else printf("%d\n",f(x,y,z));
}
int main()
{
	solve();
	return 0;
}
