Problem:
 Score : 300 points    Problem 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.      Constraints  1 \leq X \leq Y \leq 10^{18}  All input values are integers.         Input Input is given from Standard Input in the following format:  X  Y       Output Print the maximum possible length of the sequence.        Sample Input 1 3 20      Sample Output 1 3  The sequence 3,6,18 satisfies the conditions.       Sample Input 2 25 100      Sample Output 2 3       Sample Input 3 314159265 358979323846264338      Sample Output 3 31

Solution (Python):
x,y=map(int,input().split())
ans=0
while x<=y:
    x = x*2
    ans +=1
print(ans)

Solution (Python):
l, r = map(int, input().split())

cnt = 0
while l <= r:
	cnt += 1
	l *= 2
print(cnt)

Solution (Python):
x, y = map(int, input().split())
c = 0
while x <= y:
  c += 1
  x += x
print(c)

Solution (Python):
x,y = [int(x) for x in input().split()]

count = 1

while True:
    if x * 2 <= y:
        x = x * 2
        count += 1
    else:
        break

print(count)

Solution (Python):
from math import log

X, Y = [int(val) for val in raw_input().split(" ")]
val = Y/X
if val < 2**30:
    print int(log(val,2))+1
else:
    print int(log(val/2**30,2))+31

Solution (Python):
X, Y=[int(_) for _ in input().strip().split()]
tmp=X
count=0
while tmp <= Y:
    count += 1
    tmp*=2
print(count)

Solution (Python):


X, Y = map(int, input().split())
cnt = 0
num = X
while num <= Y:
    cnt += 1
    num = num*2

print(cnt)

Solution (Python):
X,Y = map(int,input().split(" "))

div = Y // X 

num = 1
count = 1
while div >= num:
	num <<= 1
	count += 1

print(count-1)

Solution (Python):
X, Y = map(int, input().split())
n = Y//X
counter = 0
while 2**counter<=n:
    counter += 1

print(counter)

Solution (Python):
'''input
10 100
'''
x,y = map(int,raw_input().split())
ans = 0
m = 1
while y >= m*x:
	ans += 1
	m <<= 1
print ans

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    x,y = LI()
    r = 0
    while x <= y:
        x *= 2
        r += 1

    return r



print(main())

Solution (Python):
a, b = map(int, raw_input().split())
ret = 0
while a <= b:
    ret += 1
    a *= 2
print ret

Solution (Python):
a,b = map(int, raw_input().strip().split())
counter = 0
while a<=b:
    counter += 1
    a *= 2
print counter

Solution (Python):
def main():
    x,y = map(int,input().split())

    ans = 0
    while(x <= y):
        x *= 2
        ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
X, Y = map(int, input().split())



from math import log2
eps = 10**(-9)




def ans(start, end):

    if start + 1 == end:
        return start
    mid = (start + end)//2
    if X * 2**mid  <= Y:
        return ans(mid, end)
    else:
        return ans(start, mid)

print(ans(0, 60)+1)

Solution (Python):
s = input().split(' ')
a = []
for w in s:
    a.append(int(w))

len = 0
while a[0] <= a[1]:
    len += 1
    a[0] *= 2

print(len)

Solution (Python):
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache, reduce
from operator import xor
from heapq import heappush, heappop
INF = float("inf")
sys.setrecursionlimit(10**7)


dy4, dx4 = [0, -1, 0, 1], [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W
def ceil(a, b): return (a + b - 1) // b


def main():
    X, Y = map(int, input().split())
    ans = 0
    while X <= Y:
        X *= 2
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
X, Y = [int(x) for x in input().split()]

count = 0
while Y >= X:
	X = 2 * X
	count += 1
	
print(count)

Solution (Python):
x, y = map(int, raw_input().split())
ans = 0

while x <= y:
    x *= 2
    ans += 1

print ans

Solution (Python):
x,y=map(int,input().split())
i=0
while x<=y:
 i+=1
 x*=2
print(i)

Solution (Python):
x,y=map(int,input().split())
ans=0
while x<=y:
  x*=2
  ans+=1
print(ans)

Solution (Python):
a = input().split()
a0 = int(a[0])
a1 = int(a[1])
num=0
while True:
    num += 1
    if a0*2 > a1:
        break
    a0 = a0*2

print(num)

Solution (Python):
X, Y = map(int, input().split())
i = 1
x = X
while x <= Y:
    x = 2*x
    i = i + 1
print(i-1)

Solution (Python):
x, y = map(int, input().split())
i = 0
while x <= y:
  x *= 2
  i += 1
print(i)

Solution (Python):
S,L = list(map(int,input().split()))
count = 0
while L >= S:
  S *= 2
  count += 1
print (count)

Solution (Python):
x,y = [int(x) for x in input().split()]

flag = True
count = 1

while flag:
    if x * 2 <= y:
        x = x * 2
        count += 1
        continue
    else:
        flag = False

print(count)

Solution (Python):
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
[x,y]=i2()
k=0
n=1
while y>=n*x:
 
 k+=1
 n*=2
print(k)

Solution (Python):
def solve(x, y):
    i = 0
    while x <= y:
        i += 1
        x *= 2
        
    print(i)


if __name__ == '__main__':
    x, y = map(int, input().split(' '))
    solve(x, y)

Solution (Python):



def solve(x, y):
    r = y // x
    return r.bit_length()


def main():
    x, y = (int(z) for z in input().split())
    res = solve(x, y)
    print(res)


if __name__ == '__main__':
    main()

Solution (Python):
s = input().split()
x = int(s[0])
y = int(s[1])

count = 0
tmp = x

while tmp <= y:
    count+=1
    tmp*=2

print(count)

Solution (Python):
X,Y = map(int,input().split())
from math import log2,ceil
p = ceil(log2(Y)-log2(X))
while Y >= X*(2**p):
  p += 1
print(p)

Solution (Python):

import math

s = raw_input().split()
x = int(s[0])
y = int(s[1])
ans = 0
while x <= y:
	ans += 1
	x = x*2
print ans

Solution (Python):
X, Y = map(int, input().split())
i = 0
while Y >= X:
    X *= 2
    i += 1
print(i)

Solution (Python):
X, Y = map(int, input().split())

a = X
i = 0
while a <= Y:
    a = a * 2
    i += 1

print(i)

Solution (Python):
X,Y = map(int, input().split())

x = X
cnt = 0
while x <= Y:
	cnt += 1
	x *= 2
print(cnt)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
while X <= Y:
    X *= 2
    ans += 1

print(ans)

Solution (Python):



def solve():
    x, y = map(int, input().split())
    ans = 0
    while x <= y:
        ans += 1
        x *= 2
    print(ans)

if __name__=="__main__":
    solve()

Solution (Python):
x, y = list(map(int, input().split()))
a = x
ans = 0
while a <= y:
    a = a << 1
    ans += 1
print(ans)

Solution (Python):
x, y = map(int, input().split())
z = y//x
print(len(bin(z)) - 2)

Solution (Python):


import sys

line = sys.stdin.readline()
X, Y = map(int, line.split())

cnt = 0
while(True):
    cnt += 1
    X *= 2
    if X > Y:
        break

print(cnt)

Solution (Python):
x, y = map(int, input().split())
num = x
ans = []
while num <= y:
    ans.append(num)
    num *= 2
print(len(ans))

Solution (Python):
from sys import stdin
n,m = map(int,stdin.readline().split())
a= []
while True:
    if n > m:
        break
    a.append(n)
    n = 2*n
print len(a)

Solution (Python):

def inpl(): return tuple(map(int, input().split()))
X, Y = inpl()
res = 0

while X * 2**res <= Y:
    res += 1

print(res)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
while X <= Y:
  ans += 1
  X *= 2

print(ans)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
while X <= Y:
    X *= 2
    ans += 1

print(ans)

Solution (Python):
X,Y = map(int,input().split())
a = X
ans = 1
while True:
    a *= 2
    if a > Y: break
    ans += 1
print(ans)

Solution (Python):
X, Y = map(int, input().split())
A = [X]
while True:
    Ai1 = A[-1] * 2
    if Ai1 <= Y:
        A.append(Ai1)
    else:
        break

print(len(A))

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import random
import re
import string

X, Y = map(int, input().split())
n = X
ans = 0
while n <= Y:
    ans += 1
    n *= 2
print(ans)

Solution (Python):
X, Y = map(int, input().split())
ans = 1
while X * (2 ** ans) <= Y:
    ans += 1
print(ans)

Solution (Python):
x, y = map(int, input().split())
ans = 1
while 2 * x <= y:
    x *= 2
    ans += 1
print(ans)

Solution (Python):
X,Y = map(int, raw_input().split())
ans = 0
while X<=Y:
  X*=2
  ans += 1
print ans

Solution (Python):
X,Y = map(int,input().split())
a = X*2
c = 1
while (a<=Y):
	c+=1
	a*=2
print(c)

Solution (Python):
[X,Y]=map(int, raw_input().split())
ans=0
while(X<=Y):
    X*=2
    ans+=1
print ans

Solution (Python):
X, Y = map(int, input().split())
ans = 1
while X * 2 <= Y:
    X *= 2
    ans += 1
print(ans)

Solution (Python):
X,Y=[int(i) for i in input().split()]
ans=0
while X<=Y:
        ans+=1
        X*=2
print(ans)

Solution (Python):
x, y = map(int, input().split())

a = x
ans = 0
while a <= y:
    a *= 2
    ans += 1
print(ans)

Solution (Python):
x, y = map(int, raw_input().split())

l = 0
while x <= y:
    x *= 2
    l += 1
print l

Solution (Python):
X, Y= map(int,input().split())
ans = 0
while X<=Y:
  ans += 1
  X = X*2
print(ans)

Solution (Python):
x, y = map(int, input().split())
ans = 1
while True:
    x <<= 1
    if x > y:
        break
    ans += 1
print(ans)

Solution (Python):
x,y=map(int,input().split())
res=0
while x<=y:
    res+=1
    x*=2
print(res)

Solution (Python):
a, b = map(int, input().split())
i = a
ans = 0
while i <= b:
  ans += 1
  i *= 2
  
print(ans)

Solution (Python):
'''input
3 20
'''

def list_input():
    return list(map(int,input().split()))
def map_input():
    return map(int,input().split())
def map_string():
    return input().split()
    
x,y = map_input()
ans = 0
while x <= y:
	x *= 2
	ans += 1
print(ans)