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<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int A,B,C;
int main(){
	cin>>A>>B>>C;
	int ans=0;
	while (1){
		if ((A&1)||(B&1)||(C&1)) break;
		if (A==B&&B==C){puts("-1");return 0;}
		ans++;
		int na=(B+C)/2,nb=(A+C)/2,nc=(A+B)/2;
		A=na,B=nb,C=nc;
	}
	printf("%d\n",ans);
	return 0;
}