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;

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();
		int sum=a+b+c;

		if(a%2==1 || b%2==1 || c%2==1) {
			System.out.println(0);
		}
		else if(a==b&&b==c) {
			System.out.println(-1);
			System.exit(0);
		}
		else {
			int max=11451419;
			int tmpc=0;
			while(true) {
				long ksn=(((long)sum)*(powz(2,tmpc+1)-powz(-1,tmpc+1))+((long)a)*(3*powz(-1,tmpc+1)))/(3*powz(2,tmpc+1));
				if(ksn%2==0) {
					tmpc++;
				}
				else {
					max=Math.min(max, tmpc);
					tmpc=0;
					break;
				}
			}

			while(true) {
				long ksn=(((long)sum)*(powz(2,tmpc+1)-powz(-1,tmpc+1))+((long)b)*(3*powz(-1,tmpc+1)))/(3*powz(2,tmpc+1));
				if(ksn%2==0) {
					tmpc++;
				}
				else {
					max=Math.min(max, tmpc);
					tmpc=0;
					break;
				}
			}

			while(true) {
				long ksn=(((long)sum)*(powz(2,tmpc+1)-powz(-1,tmpc+1))+((long)c)*(3*powz(-1,tmpc+1)))/(3*powz(2,tmpc+1));
				if(ksn%2==0) {
					tmpc++;
				}
				else {
					max=Math.min(max, tmpc);
					tmpc=0;
					break;
				}
			}
			System.out.println(max+1);
		}
	}
	static long powz(long a,long b) {
		long tmpa=1;
		for(int i=0; i<b; i++) {
			tmpa*=a;
		}
		return tmpa;
	}
}