output_description: Print the maximum possible length of the sequence.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X Y
attempt: #!/usr/bin/env python3
  # -*- coding: utf-8 -*-
  """
  Created on 2019/3/16
  Solved on 2019/3/
  @author: shinjisu
  """
  
  
  # ABC 083 C Multiple Gift
  import math
  
  # import numpy as np
  
  
  def getInt():
      return int(input())
  
  
  def getIntList():
      return [int(x) for x in input().split()]
  
  
  # def getIntList(): return np.array(input().split(), dtype=np.longlong)
  
  
  def zeros(n):
      return [0] * n
  
  
  # def zeros(n): return np.zeros(n, dtype=np.longlong)
  
  
  def getIntLines(n):
      return [int(input()) for i in range(n)]
  
  
  """
  def getIntLines(n):
      data = zeros(n)
      for i in range(n):
          data[i] = getInt()
      return data
  """
  
  
  def zeros2(n, m):
      return [zeros(m) for i in range(n)]  # obsoleted zeros((n, m))で代替
  
  
  def getIntMat(n, m):  # n行に渡って、1行にm個の整数
      # mat = zeros((n, m))
      mat = zeros2(n, m)
      for i in range(n):
          mat[i] = getIntList()
      return mat
  
  
  ALPHABET = [chr(i + ord("a")) for i in range(26)]
  DIGIT = [chr(i + ord("0")) for i in range(10)]
  N1097 = 10**9 + 7
  INF = 10**18
  
  
  class Debug:
      def __init__(self):
          self.debug = True
  
      def off(self):
          self.debug = False
  
      def dmp(self, x, cmt=""):
          if self.debug:
              if cmt != "":
                  print(cmt, ":  ", end="")
              print(x)
          return x
  
  
  def prob():
      d = Debug()
      d.off()
      X, Y = getIntList()
      d.dmp((X, Y), "X, Y")
      return int(math.log2(Y / X)) + 1
  
  
  ans = prob()
  if ans is None:
      pass
  elif type(ans) == tuple and ans[0] == 1:  # 1,ans
      for elm in ans[1]:
          print(elm)
  else:
      print(ans)
  
problem_description: Statement
  
  As a token of his gratitude, Takahashi has decided to give his mother an
  integer sequence. The sequence A needs to satisfy the conditions below:
  
    * A consists of integers between X and Y (inclusive).
    * For each 1\leq i \leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.
  
  Find the maximum possible length of the sequence.
samples: [{"input": "3 20", "output": "3\n    \n\nThe sequence 3,6,18 satisfies the conditions.\n\n* * *"}, {"input": "25 100", "output": "3\n    \n\n* * *"}, {"input": "314159265 358979323846264338", "output": "31"}]