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
import java.util.*;

public class Main {
    //-------------------------------------------------------------//
    public static final void main(String[] args) {
        new Main().solve();
    }
    //-------------------------------------------------------------//
    private final Scanner sc = new Scanner(System.in);
    void solve() {
        long[] cs = new long[3];
        for (int i = 0; i < 3; i++) cs[i] = sc.nextInt();
        long ans = 0;
        long s = System.currentTimeMillis();
        do {
            boolean check = false;
            for (int i = 0; i < 3; i++) if (cs[i] % 2 == 1) check = true;
            if (check) break;
            long newA = cs[1] / 2L + cs[2] / 2L;
            long newB = cs[0] / 2L + cs[2] / 2L;
            long newC = cs[0] / 2L + cs[1] / 2L;
            cs[0] = newA; cs[1] = newB; cs[2] = newC;
            ans++;
            if (System.currentTimeMillis() - s >= 1900L) {
                System.out.println(-1);
                return;
            }
        } while(true);
        System.out.println(ans);
    }
}