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.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    private boolean ok(int A, int B, int C) {
        return (A % 2 == 0) && (B % 2 == 0) && (C % 2 == 0);
    }

    public void run() {
        Scanner sc = new Scanner(System.in);
        int A = sc.nextInt();
        int B = sc.nextInt();
        int C = sc.nextInt();

        Set<String> set = new HashSet<>();

        int cnt = 0;
        int a = A;
        int b = B;
        int c = C;
        while (ok(a, b, c)) {
            String s = String.format("%d,%d,%d", a, b, c);
            if (set.contains(s)) {
                cnt = -1;
                break;
            }
            set.add(s);

            int at = b / 2 + c / 2;
            int bt = c / 2 + a / 2;
            int ct = a / 2 + b / 2;

            a = at;
            b = bt;
            c = ct;
            cnt++;
        }

        System.out.println(cnt);
        return;
    }

}