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.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Integer A = Integer.parseInt(sc.next());
        Integer B = Integer.parseInt(sc.next());
        Integer C = Integer.parseInt(sc.next());
        int count = 0;
        int tmpA = 0;
        int tmpB = 0;
        int tmpC = 0;

        List<String> ABCList = new ArrayList<String>();
        ABCList.add(A.toString() + B.toString() + C.toString());

        while (true) {
            if (A % 2 != 0 || B % 2 != 0 || C % 2 != 0) {
                break;
            }
            tmpA = A;
            tmpB = B;
            tmpC = C;

            A = tmpB / 2 + tmpC / 2;
            B = tmpC / 2 + tmpA / 2;
            C = tmpA / 2 + tmpB / 2;

            count++;

            if (ABCList.contains(A.toString() + B.toString() + C.toString())) {
                count = -1;
                break;
            }
            ABCList.add(A.toString() + B.toString() + C.toString());
        }

        PrintWriter out = new PrintWriter(System.out);
        out.println(count);
        out.flush();
        sc.close();
    }
}