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 <algorithm>
#include <string>
using namespace std;
int main(void){
	int a,b,c;
	cin>>a>>b>>c;
	int A=a,B=b,C=c;
	int d,e,f;
	int i=0;
	while(a%2==0&&b%2==0&&c%2==0){
		d=a/2+b/2;
		f=b/2+c/2;
		e=c/2+a/2;
		if(A==d&&B==e&&C==f){
			cout<<-1<<endl;
			return 0;
		}
		a=d; b=e; c=f;
		i++;
	}
	cout<<i<<endl;
    
}
