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.*;
import java.io.*;

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 change = 0;
        
        while(true){
        	if(A%2!=0||B%2!=0||C%2!=0)break;
        	int nextA = (B+C)/2;
        	int nextB = (C+A)/2;
        	int nextC = (A+B)/2;
        	change++;
        	if(nextA%2!=0 || nextB%2!=0 || nextC%2!=0) break;
        	int minimum = Math.min(Math.min(nextA,nextB),nextC);
        	A = nextA;
        	B = nextB;
        	C = nextC;
        	if(nextA==nextB&&nextA==nextC){
        		change=-1;
        		break;
        	}
        }
        System.out.println(change);
    }
}