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) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		long a = sc.nextLong();
		long b = sc.nextLong();
		long c = sc.nextLong();
		sc.close();
		long[] array = {a,b,c};

		if(a%2!=0||b%2!=0||c%2!=0){
			System.out.println(0);
			return;
		}

		if(a==b&&b==c){
			System.out.println(-1);
			return;
		}

		long ans = 1L;

		while(true) {
			long aa = array[0]/2L;
			long bb = array[1]/2L;
			long cc = array[2]/2L;

			array[0]= bb+cc;
			array[1]= aa+cc;
			array[2]= aa+bb;
			if(array[0]%2==0&&array[1]%2==0&&array[2]%2==0) {
				ans++;
			}else {
				System.out.println(ans);
				return;
			}
		}
	}
}