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.HashSet;
import java.util.Scanner;
import java.util.Set;


public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt();
		Set<String> s = new HashSet<String>();
		int cnt = 0;
		s.add(""+a+b+c);
		boolean f = false;
		
		while(true) {
			if(a % 2== 1 || b % 2== 1||c % 2== 1)	break;
			int aa = (b+c)/2, bb = (a+c)/2, cc = (a+b)/2;
			a = aa; b = bb; c = cc;
			if(s.contains(""+a+b+c)) {
				f = true;
				break;
			}
			cnt ++;
		}
		
		if(f)
			System.out.println(-1);
		else
			System.out.println(cnt);
		
	}
}
