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[] k = new int[3];
		for(int i = 0; i < 3; i++) {
			k[i] = sc.nextInt();
		}
		sc.close();
		if(k[0] % 2 == 1 || k[1] % 2 == 1 || k[2] % 2 == 1) {
			System.out.println(0);
			System.exit(0);
		}
		if(k[0] == k[1] || k[1] == k[2]) {
			System.out.println(-1);
			System.exit(0);
		}
		int cnt = 0;
		while(k[0] % 2 == 0 && k[1] % 2 == 0 && k[2] % 2 == 0) {
			int t0 = k[0];
			int t1 = k[1];
			int t2 = k[2];
			k[0] = (t1 + t2) / 2;
			k[1] = (t0 + t2) / 2;
			k[2] = (t0 + t1) / 2;
			cnt++;
		}
		System.out.println(cnt);
	}
}