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;
int a,b,c,a1,b1,c1;
signed main()
{
    cin>>a>>b>>c;
	for(int i=0;;i++)
	{
		if(a&1||b&1||c&1)cout<<i,exit(0);
		if(a>b)swap(a,b);
		if(b>c)swap(b,c);
		if(a>b)swap(a,b);
		a1=(b+c)/2,b1=(a+c)/2,c1=(a+b)/2;
		a=a1,b=b1,c=c1;
		if(a==b&&b==c&&a==c)puts("-1"),exit(0);
	}
}