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

long long A,B,C;

int solve(){
  for (int i=0;i<1000;++i){
    if (A & 1) return i;
    if (B & 1) return i;
    if (C & 1) return i;
    long long tA=(B+C)/2;
    long long tB=(A+C)/2;
    long long tC=(B+A)/2;
    A=tA,B=tB,C=tC;
  }
  return -1;
}

int main(){
  cin >>A>>B>>C;
  cout<<solve()<<endl;
}