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

public class Main {
  public static void main(String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    String[] str = in.readLine().split(" ");
    int a = Integer.parseInt(str[0]);
    int b = Integer.parseInt(str[1]);
    int c = Integer.parseInt(str[2]);
    int count = 0;
    boolean flg = false;
    for(int i=0; i<100000; i++) {
      if(a%2==0 && b%2==0 && c%2==0) {
        int a_tmp = a;
        int b_tmp = b;
        int c_tmp = c;
        a_tmp = b/2 + c/2;
        b_tmp = a/2 + c/2;
        c_tmp = a/2 + b/2;
        a = a_tmp;
        b = b_tmp;
        c = c_tmp;
        count += 1;
      } else {
        flg = true;
        break;
      }
    }
    System.out.println(flg == false?-1:count);
  }
}