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 <stdio.h>

long long a,b,c;

int main()
{
	scanf ("%lld %lld %lld",&a,&b,&c);

	for (int t=0;t<10000;t++){
		if (a % 2 || b % 2 || c % 2){
			printf ("%d\n",t);
			return 0;
		}
		long long p = (b + c) / 2;
		long long q = (c + a) / 2;
		long long r = (a + b) / 2;
		a = p; b = q; c = r;
	}
	puts("-1");

	return 0;
}