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>

using namespace std;
typedef long long ll;

ll A,B,C;

int main()
{
	cin >> A >> B >> C;

	if ((A|B|C)%2 == 1) {
		cout << 0 << "\n";
		return 0;
	}
	
	ll X = (A|B|C)^(A&B&C);	
	for (int i=1; i<32; i++) {
		if ((X&(1<<i)) > 0) {
			cout << i << "\n";
			return 0;
		}
	}

	cout << "-1\n";
	return 0;
}