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 main()
{
int A,B,C,count=0,ba=0,bb=0,bc=0;scanf("%d %d %d",&A,&B,&C);
while(A%2!=1&&B%2!=1&&C%2!=1)
{
  if(max({ba,bb,bc})==max({A,B,C})&&min({ba,bb,bc})==min({A,B,C})){count=-1;break;}
  int a=A/2,b=B/2,c=C/2;ba=A,bb=B,bc=C;
  A=b+c,B=a+c,C=a+b;
  count++;
}
printf("%d\n",count);
}