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 ans;

int main()
{
    cin >> a >> b >> c;
    while(!(a%2+b%2+c%2) && ans++ < 1000){
        int am = a/2, bm = b/2, cm = c/2;
        a = bm+cm; b = am+cm; c = bm+am;
    }
    cout << (ans == 1001 ? -1 : ans) << endl;
    return 0;
}
