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);
    long a=sc.nextLong(),b=sc.nextLong(),c=sc.nextLong(),count=0;
    
    while(check(a,b,c)) {
    	long buffa=a/2,buffb=b/2,buffc=c/2;
    	a=buffb+buffc;
    	b=buffa+buffc;
    	c=buffa+buffb;
    	count++;
    }
    System.out.println(count);
  }
	public static boolean check(long a,long b,long c) {
		if(a%2==0&&a==b&&a==c) {
			System.out.println(-1);
			System.exit(0);
			return false;
		}else {
			if(a%2==0&&b%2==0&&c%2==0) {
				return true;
			}else {
				return false;
			}
		}
	}
}
