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

public class Main {
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);

    long A = scanner.nextInt();
    long B = scanner.nextInt();
    long C = scanner.nextInt();
    int tot = 0;
    while (allEven(A, B, C)) {
      if (allSame(A, B, C)) {
        System.out.println(-1);
        return;
      }
      long newA = (B + C) / 2;
      long newB = (A + C) / 2;
      long newC = (A + B) / 2;
      A = newA;
      B = newB;
      C = newC;
      tot++;
    }
    System.out.println(tot);
  }

  private static boolean allSame(long... nums) {
    return nums[0] == nums[1] && nums[1] == nums[2];
  }

  private static boolean allEven(long... nums) {
    for (long n : nums) if (n % 2 != 0) return false;
    return true;
  }
}
