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 kbscanner = new Scanner(System.in);
		int a = kbscanner.nextInt();
		int b = kbscanner.nextInt();
		int c = kbscanner.nextInt();
		
		kbscanner.close();
		
		int nextA, nextB, nextC;
		nextA = nextB = nextC = 0;
		
		int times = 0;
		
		while(true){
			nextB += a / 2;
			nextC += a / 2;
			
			nextC += b / 2;
			nextA += b / 2;
			
			nextA += c / 2;
			nextB += c / 2;
			
			if(a % 2 != 0 || b % 2 != 0 || c % 2 != 0){
				break;
			}
			else if(nextA == nextB && nextB == nextC){
				times = -1;
				break;
			}
			
			a = nextA;
			b = nextB;
			c = nextC;
			
			nextA = nextB = nextC = 0;
			
			times++;
			
		}
		
		System.out.print(times);

	}

}