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 formerA = a;
		long formerB = b;
		long formerC = c;
		long result = 0;
		while(true) {
			if(unEven(a) || unEven(b) || unEven(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(formerA == a && formerB == b && formerC == c) {
				result = -1;
				break;
			}
		}
		System.out.println(result);
	}
	private static boolean unEven(long var) {
		return (var % 2!=0);
	}
}