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();
		int B=sc.nextInt();
		int C=sc.nextInt();
		if(A%2==1||B%2==1||C%2==1){
			System.out.println(0);
			System.exit(0);
		}
		Set<String> s=new HashSet<String>();
		int a=0,b=0,c=0;
		int count=0;
		while(true){
	

			count++;
			a=(B>>1)+(C>>1);
			b=(A>>1)+(C>>1);
			c=(A>>1)+(B>>1);
			if(a%2==1||b%2==1||c%2==1) break;
			String str=String.format("%010d", a)+String.format("%010d", b)+String.format("%010d", c);
			if(s.contains(str)){
				count=-1;
				break;
			}
			s.add(str);
			A=a;B=b;C=c;
		}
		System.out.println(count);
	}
	

}