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

public class Main {

	public static void main(String[] args)throws Exception {
		BufferedReader br = new BufferedReader ( new InputStreamReader(System.in));
		String [] input = br.readLine().split(" ");
		long A = Long.parseLong(input[0]);
		long B = Long.parseLong(input[1]);
		long C = Long.parseLong(input[2]);
		long defineA= A;
		long defineB = B;
		long defineC = C;
		long result = 0;
		/*if(Even(A,B,C)){
			result = -1;
		}else if(A+B+C == 3) {
			result = 0;
		}else {*/
			while(true) {
				if(Even(A) || Even(B) || Even(C)) {
					break;
				}
				long A2 = A/2;
				long B2 = B/2;
				long C2 = C/2;
				A = B2 + C2;
				B = A2 + C2;
				C = A2 + B2;
				result++;
				if(defineA == A && defineB == B && defineC == C) {
					result = -1;
					break;
				}
			}
		//}
		System.out.println(result);
	}
	private static boolean Even(long A,long B,long C) {
		return (A % 2!=0) && (B % 2!=0) && (C % 2!=0);
	}
	private static boolean Even(long var) {
		return (var % 2!=0);
	}

}