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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Scanner;

/**
 * Built using CHelper plug-in Actual solution is at the top
 *
 * @author Silviase
 */
public class Main {

  public static void main(String[] args) {
    InputStream inputStream = System.in;
    OutputStream outputStream = System.out;
    Scanner in = new Scanner(inputStream);
    PrintWriter out = new PrintWriter(outputStream);
    ACookieExchanges solver = new ACookieExchanges();
    solver.solve(1, in, out);
    out.close();
  }

  static class ACookieExchanges {

    public void solve(int testNumber, Scanner in, PrintWriter out) {
      int a = in.nextInt();
      int b = in.nextInt();
      int c = in.nextInt();
      int cnt = 0;
      if (a == b && b == c && a % 2 == 0) {
        cnt = -1;
      }
      if (cnt == 0) {
        while (true) {
          if (a % 2 == 1 || b % 2 == 1 || c % 2 == 1) {
            break;
          }
          int tmpa = (b + c) / 2;
          int tmpb = (a + c) / 2;
          int tmpc = (a + b) / 2;
          a = tmpa;
          b = tmpb;
          c = tmpc;
          cnt++;
        }
      }
      out.println(cnt);
    }

  }
}

