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: import math
  import itertools
  import heapq
  from sys import stdin, stdout, setrecursionlimit
  from bisect import bisect, bisect_left, bisect_right
  from collections import defaultdict, deque
  
  
  # d = defaultdict(lambda: 0)
  # setrecursionlimit(10**7)
  # inf = float("inf")
  
  
  ##### stdin ####
  def LM(t, r): return list(map(t, r))
  def R(): return stdin.readline()
  def RS(): return R().split()
  def I(): return int(R())
  def F(): return float(R())
  def LI(): return LM(int,RS())
  def LF(): return LM(float,RS())
  def ONE_SL(): return list(input())
  def ONE_IL(): return LM(int, ONE_SL())
  def ALL_I(): return map(int, stdin)
  def ALL_IL(): return LM(int,stdin)
  
  ##### tools #####
  def ap(f): return f.append
  def pll(li): print('\n'.join(LM(str,li)))
  def pljoin(li, s): print(s.join(li))
  
  ##### main #####
  
  
  
  def main():
  	x,y = LI()
  
  	ans=
  	while x<=y:
  		x*=2
  		ans+=1
  		
  	print(ans)
  
  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"}]