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>
using namespace std;
#define int long long 
int a,b,c,ans=0;
void work(){
	if(ans>1000) return ;
	if(a%2 or b%2 or c%2) {
		cout<<ans;exit(0);
	}
	int aa,bb,cc;
	aa=b/2+c/2,bb=a/2+c/2,cc=a/2+b/2;
	a=aa,b=bb,c=cc;
	ans++;work();
}
signed main(){
	cin>>a>>b>>c;
	work();
	puts("-1");
	
	return 0;
}