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 sc = new Scanner(System.in);
          int A = sc.nextInt();
          int B = sc.nextInt();
          int C = sc.nextInt();
          int count = 0;

          while(A%2 == 0 && B%2 == 0 && C%2 == 0){
        	  int Ab = A/2;
        	  int Bb = B/2;
        	  int Cb = C/2;
        	  A = 0;
        	  B = 0;
        	  C = 0;
        	  A += Bb + Cb;
        	  B += Ab + Cb;
        	  C += Ab + Bb;
        	  count++;
              	if(A == B && A == C){
              		count = -1;
              		break;
              	}
              }
          System.out.println(count);
          }
}