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) {
		final Scanner sc = new Scanner(System.in);
		long a = sc.nextLong();
		long b = sc.nextLong();
		long c = sc.nextLong();
		if(a%2==0&&b%2==0%2&&c%2==0) {
			int count = 1;
			for(int i = 0; i < 30; i++) {
				long na = b/2+c/2;
				long nb = a/2+c/2;
				long nc = a/2+b/2;
				a = na;b = nb;c = nc;
				if(a%2==0&&b%2==0&&c%2==0) {
					count++;
				} else {
					System.out.println(count);
					return;
				}
			}
		} else {
			System.out.println(0);
			return;
		}
		System.out.println(-1);
	}
}