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;

class Main {
  public static void main(String[] args) {
    Scanner cin = new Scanner(System.in);
    int a, b, c;
    int aa, bb, cc;
    int ans = 0;
    int tmp_a, tmp_b;

    a = cin.nextInt();
    b = cin.nextInt();
    c = cin.nextInt();

    aa = a;
    bb = b;
    cc = c;

    while (a % 2 == 0 && b % 2 == 0 && c % 2 == 0){
      tmp_a = a;
      a = b / 2 + c / 2;
      tmp_b = b;
      b = tmp_a / 2 + c / 2;
      c = tmp_a / 2 + tmp_b / 2;
      ans ++;
      //System.out.println(a + " " + b + " " + c);
      if (a == aa & b == bb & c == cc){
        ans = -1;
        break;
      }
    }
    System.out.println(ans);
  }
}
