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;
import java.util.stream.Stream;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int[] line = Stream.of(sc.nextLine().split(" ", 0)).mapToInt(Integer::parseInt).toArray();
		int con=0;
		boolean isdivflg = true;
		if(line[0] == line[1] && line[1] == line[2] && line[2] == line[0] && line[0] % 2 == 0) {
			con = -1;
		}else{
			while (true) {
				int[] line_div = new int[3];
				for (int i = 0; i < 3; i++) {
					if (line[i] % 2 == 1) {
						isdivflg = false;
					}
					line_div[i] = line[i] / 2;
				}
				if (isdivflg) {
					line[0] = line[0] - line_div[0] + line_div[2];
					line[1] = line[1] - line_div[1] + line_div[0];
					line[2] = line[2] - line_div[2] + line_div[1];
					con++;
				}else {
					break;
				}

			}
		}
		System.out.println(con);
	}
}
