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>
#include<cmath>
using namespace std;
int main(){
	long long a,b,c;
	cin>>a>>b>>c;
	int f;
	bool h=false;
	for(int i=0;i<=1000;i++){
		if(a%2==1||b%2==1||c%2==1){
			f=i;h=true;break;
		}
		int a1,b1,c1;
		a1=a;
		b1=b;
		c1=c;
		a=b1/2+c1/2;
		b=a1/2+c1/2;
		c=a1/2+b1/2;		
	}
	if(h==true)
		cout<<f<<endl;
	else
		cout<<"-1"<<endl;
}