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>
using namespace std;
int a,b,c,ans;
int A,B,C,A1,B1,C1;
int main() {
	scanf("%d %d %d",&a,&b,&c);
	ans=0;
	A=a; B=b; C=c;
	while (1) {
		if (A%2==1||B%2==1||C%2==1)
			break;
		ans++;
		A1=A; B1=B; C1=C;
		A=B1/2+C1/2;
		B=A1/2+C1/2;
		C1=A1/2+B1/2;
		if (A==a&&B==b&&C==c) {
			ans=-1;
			break;
		}
	}
	printf("%d\n",ans);
	return 0;
}