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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;

public class Main {
        public static void main(String[] args) throws IOException {

          System.out.println(new Main().run(args, System.in));
    }
    public String run(String[] args, InputStream in) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(in));
        String[] val = reader.readLine().replaceAll("\\s+", " ").split(" ");

       long A = Long.parseLong(val[0]);
       long B = Long.parseLong(val[1]);
       long C = Long.parseLong(val[2]);
       if (A == B && B==C && (A % 2)== 0) return "-1";

      long count = 0;
       while (true) {
           if (A%2 == 1|| B%2 == 1 || C%2 == 1) {
               break;
           }           
           count++;
           long a2 = A / 2;
           long b2 = B / 2;
           long c2 = C / 2;

           A = b2 + c2;
           B = a2 + c2;
           C = b2 + a2;
       }              
       return String.valueOf(count);
    }   
}
