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
  import sys
  
  
  def solve(X: int, Y: int):
      ans = []
  
      cur = X
      while cur <= Y:
          ans.append(cur)
          cur *= 2
  
      print(len(ans))
      return
  
  
  # Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
  def main():
      def iterate_tokens():
          for line in sys.stdin:
              for word in line.split():
                  yield word
  
      tokens = iterate_tokens()
      X = int(next(tokens))  # type: int
      Y = int(next(tokens))  # type: int
      solve(X, Y)
  
  
  if __name__ == "__main__":
      main()
  
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"}]