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<cstring>
using namespace std;
int main(int argc, char *argv[])
{
	int a,b,c;
	cin>>a>>b>>c;
	int sum=0;
	while(sum<=10000){
		if(a%2==1||b%2==1||c%2==1)break;
		int a1,b1,c1;
		a1=a/2;
		b1=b/2;
		c1=c/2;
		a=b1+c1;
		b=a1+c1;
		c=b1+a1;
		sum++;
	}
	if(sum>10000)sum=-1;
	cout<<sum<<endl;
	return 0;
}