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 rep(i,n) for(int i=0;i<(n);++i)
using namespace std;
using ll=long long;
ll a,b,c,d;
int main(){
  cin>>a>>b>>c;
  if(!(a&1)&&a==b&&b==c)return cout<<-1,0;
  while(!(a&1)&&!(b&1)&&!(c&1)){
    d++;
    a/=2;
    b/=2;
    c/=2;
    ll a1=b+c;
    ll b1=a+c;
    ll c1=b+a;
    a=a1,b=b1,c=c1;
  }
  cout<<d<<endl;
}