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<algorithm>
using namespace std;
const int N=1000000;
int main()
{
	int a,a1,b,b1,c,c1,k,i;
	while(cin>>a>>b>>c){
		k=0;
		for(i=1;i<N;i++){
			if(a%2==0 && b%2==0 &&c%2==0){
				k++;
			}
			else{
				break;
			}
			a1=a/2;b1=b/2;c1=c/2;
			a=b1+c1;b=a1+c1;c=b1+a1;
		}
		if(i<N) printf("%d\n",k);
		else printf("-1\n");
	}
}