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>
#include<cstring>
#include<algorithm>
using namespace std;
const int lim=1000000;
int a,b,c,t1,t2,t3,i,j,k,n,m,w;
int main(){
	scanf("%d%d%d",&a,&b,&c);
	for (i=1;i<=lim;i++){
		if (a%2||b%2||c%2) break;
		t1=b/2+c/2;t2=a/2+c/2;t3=a/2+b/2;
		a=t1;b=t2;c=t3;
	}
	if (i>lim) puts("-1");else printf("%d\n",i-1);
	return 0;
}