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: X, Y = map(int, input().split())
  maxstack = []
  stack = []
  for i in range(X, Y + 1):
      j = i
      # print("j",j)
      while j <= Y + 1:
          #     print("loopj",j)
          stack.append(j)
          j *= 2
      #     print(stack, len(stack))
      if len(maxstack) < len(stack):
          maxstack.clear()
          maxstack.extend(stack)
      # print(maxstack)
      stack.clear()
  print(len(maxstack))
  
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"}]