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 <bits/stdc++.h>
#define rep(i,n) for ((i)=1;(i)<=(n);(i)++)
#define per(i,n) for ((i)=n;(i)>=(1);(i)--)
using namespace std;

long long a,b,c,s;
int main(){
	cin>>a>>b>>c;
	while(!(a&1)&&!(b&1)&&!(c&1)){
		s++;
		int ta=a/2,tb=b/2,tc=c/2;
		a=tb+tc;b=ta+tc;c=ta+tb;
		if(s>1000000){
			puts("-1");
			return 0;
		}
	}
	cout<<s<<endl;
	return 0; 
}