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 pb push_back 
using namespace std;

const int maxn=1;
typedef long long ll;

int n,m,ans;
int a,b,c;

int main()
{
	int i,j,k;
	scanf("%d%d%d",&a,&b,&c);
	for(i=1;i<=200;++i)
	{
		int x=a,y=b,z=c;
		if(x%2||y%2||z%2)
		{
			printf("%d",i-1);
			return 0;
		}
		a=(x+y)/2;
		b=(y+z)/2;
		c=(x+z)/2;
	}
	
	printf("-1");
	return 0;
}
