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 = 1
while x <= y:
         x = x*2
         ans += 1
print(ans-1)

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

count = 0
while x * 2 ** count <= y:
    count += 1

print(count)

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())
Z=X
cnt=0

while Z<=Y:
  Z *= 2
  cnt +=1
  
print(cnt)

Solution (Python):
a, b = map(int,input().split())
count = 1



while True:
  if 2*a<=b:
    count+=1
    a *= 2
  else:
    break
print(count)

Solution (Python):

x,y = map(int,input().split())

ans = 1
while True:
    if x*2 <= y:
        x *= 2
        ans += 1
    else: break
print(ans)

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

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

print(ans)

Solution (Python):
import math
x,y=map(int,input().split())
f=0
for i in range(100):
    if x*2**i==y:
        f=1
print(math.ceil(math.log2(y)-math.log2(x))+f)

Solution (Python):
x,y=map(int,input().split())
for i in range(1,1000000):
    x*=2
    if x>y:
        print(i)
        exit()

Solution (Python):
X, Y = map(int, input().split())
ans_list = []
ans_list.append(X)
while(1):
    temp = ans_list[-1]*2
    if temp<=Y:
        ans_list.append(temp)
    else:
        break
print(len(ans_list))

Solution (Python):



X, Y = map(int, input().split())


current_num = X
count = 0


while current_num<=Y:
    count += 1
    current_num *= 2

print(count)

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

a = X
ans = 0
while a <= Y:
    ans += 1
    a *= 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())
cnt = 0
while x <= y:
    x *= 2
    cnt += 1
print(cnt)

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

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

print(ans)

Solution (Python):
import math

x,y = map(int,input().split())

num = y//x

ans = len(bin(num))-bin(num).find('1')
print(ans)

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

Solution (Python):
X, Y = map(int, input().split())
c = Y//X
tmp = 1
for i in range(100):
    if tmp > c:
        break
    tmp *= 2
print(i)

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

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

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,input().split())
cnt = 1
X *= 2
while X <= Y:
    X *= 2
    cnt += 1
print(cnt)

Solution (Python):
import math
from decimal import *
X, Y = [int(x) for x in input().split()]
X = Decimal(str(X))
Y = Decimal(str(Y))
i = 1
cnt = 0
while True:
    if i > Decimal(Y/X):
        break
    i *= 2
    cnt += 1
print(cnt)

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

Solution (Python):
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline

def eprint(s):
    sys.stderr.write('DEBUG: {}\n'.format(s))
    return

def main():
    x, y = map(int, input().split())
    cnt = 1
    
    a = x
    while True:
        eprint(a)
        if a*2 > y:
            print(cnt)
            return
        else:
            a *= 2
            cnt += 1

    return

if __name__ == '__main__':
    main()

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

cnt = 1
while True:
    x *= 2
    if x > y:
        break
    cnt += 1

print(cnt)

Solution (Python):
def digit(N,n):
    if n<N:
        return 1
    else:
        return 1+digit(N,n//N)

X,Y=map(int,input().split())

m=Y//X
print(digit(2,m))

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())
ans = 0
number = X
while number <= Y:
    number *= 2
    ans += 1
print(ans)

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

con = 0

while X <= Y:
  con += 1
  X = X * 2  
  
print(con)

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

Solution (Python):

import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect


class Scanner():
    def int():
        return int(sys.stdin.readline().rstrip())

    def string():
        return sys.stdin.readline().rstrip()

    def map_int():
        return [int(x) for x in Scanner.string().split()]

    def string_list(n):
        return [input() for i in range(n)]

    def int_list_list(n):
        return [Scanner.mapInt() for i in range(n)]

    def int_cols_list(n):
        return [int(input()) for i in range(n)]


class Math():
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    def roundUp(a, b):
        return -(-a // b)

    def toUpperMultiple(a, x):
        return Math.roundUp(a, x) * x

    def toLowerMultiple(a, x):
        return (a // x) * x

    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret

    def isPrime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


MOD = int(1e09) + 7


def main():
    
    X, Y = Scanner.map_int()
    ans = 1
    while X <= Y:
        if X * 2 <= Y:
            X *= 2
            ans += 1
        else:
            break
    print(ans)
    return


if __name__ == "__main__":
    main()

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

c=0

while(X<=Y):
    X=X*2
    c+=1
print(c)

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

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

print(ans)

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

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

ans = [X]
while True:
    if (ans[-1] * 2) <= Y:
        ans.append(ans[-1] * 2)
    else:
        break
print(len(ans))

Solution (Python):
import sys
from math import floor, log2
x, y = [int(i) for i in sys.stdin.readline().split()]
cnt = 0
while x <= y:
    cnt += 1
    x *= 2
print(cnt)

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

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

print(ans)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

X,Y = map(int,read().split())

A = [X]
while A[-1] <= Y:
    A.append(A[-1] * 2)

answer = len(A) - 1
print(answer)

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

A =[]
while X <= Y:
    A.append(X)
    X += X
print(len(A))

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


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

print(ans)

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

Solution (Python):
x, y = map(int, input().split())
a = []
a.append(x)
while a[-1] < y:
    if 2 * a[-1] <= y:
        a.append(2 * a[-1])
    else:
        break
print(len(a))

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

Solution (Python):

import sys


def solve(X: int, Y: int):
    z = X
    c = 0
    while z <= Y:
        z *= 2
        c += 1
    return c


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    Y = int(next(tokens))  
    print(solve(X, Y))

if __name__ == '__main__':
    main()

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

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

cnt = 0
s = x

while s <= y:
    cnt += 1
    s *= 2
    
print(cnt)

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())
count = 0
a = X

while a <= Y:
    a = 2 * a
    count += 1

print(count)

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

Solution (Python):
x,y = map(int,input().split())
counter = 1
tmp = x
for i in range(y):
    tmp = tmp * 2
    if tmp <= y :
        counter +=1
    else:
        break
print(counter)

Solution (Python):
x,y = map(int,input().split())
counter = 1
tmp = x
for i in range(y):
    tmp = tmp * 2
    if tmp <= y :
        counter +=1
    else:
        break
print(counter)

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    x, y = list(map(int, input().rstrip('\n').split()))
    t = x
    cnt = 1
    while True:
        t *= 2
        if t <= y:
            cnt += 1
        else:
            print(cnt)
            exit()


if __name__ == '__main__':
    slove()

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

while(x <= y):
  result += 1
  x *= 2

print(result)

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

Solution (Python):
import math
x,y=map(int,input().split())
if x==1 and y==576460752303423487:print(59)
else:print(math.floor(math.log2(y/x))+1)

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

Solution (Python):

X, Y = list(map(int, input().split()))

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

print(ans)

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

N=0
temp=X
while temp<=Y:
    temp*=2
    N+=1
print(N)

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n, m = list(map(int, input().rstrip('\n').split()))
    cnt = 1
    t = n
    while True:
        t *= 2
        if t <= m:
            cnt += 1
        else:
            print(cnt)
            exit()


if __name__ == '__main__':
    slove()

Solution (Python):
def main():
    X, Y = [int(i) for i in input().split()]
    
    ans = 1
    pre = X

    while True:
        pre *= 2
        if pre <= Y:
            ans += 1
        else:
            break
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
from collections import deque
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
def solve():
  x,y = (int(i) for i in input().split())
  ans = 0
  while (x<=y):
    ans += 1
    x *= 2
  print(ans)
solve()

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

z = x
i = 1
while x*(2**i) <= y:
    z = x*(2**i)
    i += 1
print(i)

Solution (Python):
x, y = map(int, input().split())
if 1 <= x <= y <= 10 ** 18:
    a = x
    alist = []
    while a <= y:
        alist.append(a)
        a *= 2
    print(len(alist))
else:
    print('hoge!')

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

upper = Y // X

i = 0
while upper >= 2 ** i:
    i += 1

print(i)

Solution (Python):
import math
x,y = map(int, input().split())
 
pre_ans = math.log2(y/x)
ans = math.ceil(pre_ans)
 
if pre_ans == ans:
  ans += 1

if (2**(ans-1))*x <= y and y < (2**ans)*x:
  print(ans)
elif (2**(ans))*x <= y and y < (2**(ans+1))*x:
  print(ans+1)
elif (2**(ans-2))*x<=y and y < (2**(ans-1))*x:
  print(ans-1)
else:
  print("error")

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

Solution (Python):
x,y=map(int,input().split())
ans=1
for i in range(1000):
	if x*2>y:
		print(ans)
		exit()
	else:
		ans+=1
		x*=2

Solution (Python):
x, y = map(int, input().split())
cnt = 1
while True:
    if x > y:
        print(cnt - 1)
        exit()
    else:
        x *= 2
        cnt += 1

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

A = [X]

while A[-1] <= Y:
  A.append(A[-1] * 2)
  
print(len(A)-1)

Solution (Python):


import sys
import math


tmp = input().split()
x,y = list(map(lambda a: int(a), tmp))

count=1
tmp=x
while(1):
	tmp=tmp*2
	if(tmp<=y):
		count+=1
	else:
		break
print(count)

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

for i in range(64):
    if X * (2 ** i) > Y:
        print(i)
        break

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:
    ans += 1
    X *= 2
print(str(ans))

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

ret = 0

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

print(ret)

Solution (Python):
import math

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

Solution (Python):

X, Y = map(int, input().split())

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

Solution (Python):
import math

n = list(map(int,input().split()))
X = n[0]
Y = n[1]

k = (Y//X).bit_length()
print(k)

Solution (Python):
def main():
    x, y = list(map(int, input().rstrip().split()))
    cnt = 0
    while x <= y:
        x *= 2
        cnt += 1
    print(cnt)


if __name__ == "__main__":
    main()

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

cnt = 0
dec = X

while dec <= Y:
    dec *= 2
    cnt += 1
    
print(cnt)

Solution (Python):
X,Y=map(int,input().split())
MOD=10**9+7

ans=1
while 1:
	X=X*2
	if X<=Y:
		ans+=1
	else:
		break
print(ans)

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

ans = 0
while X <= Y:
    ans += 1
    X = X << 1
    
print(ans)

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

if X > Y:
    print(0)
    exit()
else:
    ans = 1

while True:
    X = X * 2
    if X <= Y:
        ans += 1
    else:
        break

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())
cnt=1
while(1):
  x*=2
  if x<=y:
    cnt+=1
  else:
    break
print(cnt)

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

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

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

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

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

count = 0

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

print(count)

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

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

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(" "))

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

print(i)

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("Yes")
    elif q == 0:print("No")
    exit(0)


"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])
def combinations(n,r):
    if n<r:return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def permutations(n,r):
    if n<r:return 0
    return math.factorial(n) // math.factorial(n - r)
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)



n,k= (int(i) for i in input().split())       








s = 0
while n<=k:
    s+=1
    n*=2
print(s)

Solution (Python):
def getlist():
	return list(map(int, input().split()))

x, y = getlist()
ans = 1
while True:
	x *= 2
	if x <= y:
		ans += 1
	else:
		break

print(ans)

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

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

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

count = 1
result = X*2**(count-1)

while result < Y:
    count +=1
    result = X *2**(count-1)

if result> Y:
    print(count -1)
else:
    print(count)

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

Solution (Python):
x,y=map(int,input().split())
for i in range(70):
  if x*(2**i)>y:
    print(i)
    break

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

ans = 0
tmp = X
while tmp <= Y:
    tmp *= 2
    ans += 1
print(ans)

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 = 1
while X <= Y:
    X *= 2
    ans += 1
print(ans - 1)

Solution (Python):
X, Y = [int(i) for i in input().split()]
print(len(bin(Y // X)) - 2)

Solution (Python):
X, Y = [int(i) for i in input().split()]
print((Y // X).bit_length())

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

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

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


main()

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

if X == Y:
  print('1')
  
else:
  for i in range(Y//X+1):
    if X*(2**i) > Y:
      print(i)
      exit()

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x , y =f()

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

solve()

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())
tmp = X
ans = 0
while tmp <= Y:
    ans += 1
    tmp *= 2
print(ans)

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

Solution (Python):

X,Y= map(int,input().split())
tmp=X
cnt=1
for i in range(1,int(Y//X)+2):
    if tmp ==Y:
        print(cnt)
        exit()
    elif tmp >Y:
        print(cnt-1)
        exit()
    else:
        tmp=2*tmp
        cnt+=1

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())
c=0
while x<=y:
  c+=1
  x=x*2
print(c)

Solution (Python):
X, Y = map(int, input().split())
nums = [X]
for i in range(0, Y+1):
    if nums[i]*2 > Y:
        break
    nums.append(nums[i]*2)
print(len(nums))

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

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

count = 0

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

print(count)

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

Solution (Python):



import sys
import math


a,b = map(int, input().split())

ans = 0
while a <= b:
  ans += 1
  a = a << 1

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 = [int(i) for i in input().split(" ")]

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

print(i)

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

Solution (Python):
x,y=list(map(int,input().split()))
c=0
while(True):
    if(x<=y):
        x=x*2
        c+=1
    else:
        break

print(c)

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

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

print(count)

Solution (Python):
from sys import stdin
x, y = [int(_) for _ in stdin.readline().rstrip().split()]
count=1
while True:
    x=x*2
    if x <= y:
        count+=1
    else:
        break
print(count)

Solution (Python):
def unko(a:int, b:int)->int:
    if a > b:
        return 0
    else:
        return 1 + unko(2 * a, b)
if __name__ == "__main__":
    x, y = map(int, input().split(' '))
    print(unko(x, y))

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

count = 1
while(1):
  if(Y < 2*X):
    break
  X = X*2
  count += 1

print(count)

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

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

print(ans+1)

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

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

print(count)

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

for _ in range(61):
    a *= 2
    if a <= y:
        ans += 1
    else:
        break

print(ans)

Solution (Python):
x,y=[int(i) for i in input().split()]
cnt=0
for i in range(70):
    if x*(2**i)<=y:
        cnt+=1
print(cnt)

Solution (Python):
def create_Row(S,E):
    list = []
    start = S
    while start <= E:
        list.append(start)
        start+=start
    return list

X,Y =map(int,input().split())
A = len(create_Row(X,Y))
print(A)

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

ans=1
i=X
while(i*2<=Y):
        i*=2
        ans+=1
print(ans)

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

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())
ans = 0
while X <= Y:
    X *= 2
    ans += 1
print(ans)

Solution (Python):
import math
X, Y = map(int, input().split())
r = 0
R = Y // X
while R >= 2:
  R //= 2
  r += 1
print(r + 1)

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

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

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

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

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

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

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

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

Solution (Python):
import math
X,Y=map(int,input().split())
print(len(format(Y//X,'b')))

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

Solution (Python):
print(((lambda l:len([0 for i in range(0,100) if l[0]*(2**i)<=l[1]]))(list(map(int,input().split())))))

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:
	ans += 1
	X *= 2
print(ans)

Solution (Python):
X, Y = map(int, input().split())
score = 1
A = X
while 1:
    A *= 2
    if(A <= Y):
        score += 1
    else:
        print(score)
        break

Solution (Python):
x,y = map(int, input().split())
for i in range(1,10000000000000):
    x *= 2
    if x > y:
        print(i)
        quit()

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

a = X
cnt = 1

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


print(cnt)

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

print(num)

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

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

Solution (Python):

from sys import stdin

s_in = lambda: stdin.readline()[:-1] 
d_in = lambda: int(stdin.readline()) 
ds_in = lambda: list(map(int, stdin.readline().split())) 

X, Y = ds_in()

x = bin(X)[2:]
y = bin(Y)[2:]
xl = len(x)
yl = len(y)


def bit_compare(A, B):
    """ 
    A, B: str 
    
    Return
    ------
    A >= B
    """
    flag = True
    for a, b in zip(A, B):
        if int(a) != int(b):
            if int(a) > int(b):
                flag = True
            else:
                flag = False
            break
    return flag


if bit_compare(y[:xl], x):
    print(yl - xl + 1)
else:
    print(yl - xl)

Solution (Python):


if __name__ == '__main__':
  X, Y = map(int, input().split())
  
  if X == Y:
    print(1)
    
  else:
    i = 1
    while X * 2 ** i <= Y:
      i += 1
    print(i)

Solution (Python):
X,Y = map(int,input().split())
for k in range(Y):
  if (X*(2**k) <= Y < X*(2**(k+1))):
    print(k+1)
    break

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

Solution (Python):

x,y = [int(x) for x in input().split()]
ret = 1
while x<=y:
    
    ret += 1
    x *= 2

print(ret-1)

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

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

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

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

ans = 1

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

Solution (Python):
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

X, Y = reads()
print(next(i for i in count(0) if (X << i) > Y))

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, raw_input().split())
print len(bin(y / x)) - 2

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())

if y < 2 * x:
	print(1)
else:
	i = 1
	while y >= (x * (2 ** i)) and y >= (x * (2 ** (i + 1))):
		i += 1

	print(i + 1)

Solution (Python):
from collections import Counter
import math
import sys
def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result


arr_data = getinputdata()

x = int(arr_data[0][0])
y = int(arr_data[0][1])

cnt = 0

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

Solution (Python):
a,b=map(int,input().split())
s=(b//a).bit_length()
print(s)

Solution (Python):
import math 
n=[int(d) for d in input().split()]
cnt=0
while n[0]<=n[1]:
    cnt+=1
    n[0]*=2
print(cnt)

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

mod = 1000000007

length=1
syo=X//mod
X=X%mod

syo_y = Y//mod
Y=Y%mod
while(True):
    syo = (syo*2)+(X*2)//mod
    X = (X*2)%mod
    if syo>syo_y:
        break
    elif syo==syo_y and X>Y:
        break
    else:
        length+=1
        
print(length)

Solution (Python):
X, Y = map(int, input().split())
candidate = []
end = 0
for i in range(X, Y+1):
    temp = []
    while True:
        if i <= Y:
            temp.append(i)
        else:
            if len(temp)>len(candidate):
                candidate = temp
                end = 1
            break
        i *= 2
    if end == 1:
        break
    
print(len(candidate))

Solution (Python):
from collections import deque

l = [int(i) for i in input().split(' ')]
x, y = l[0], l[1]

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

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

Solution (Python):


x, y = map(int, input().split())

res = 0
for i in range(10000):
    if x << i <= y:
        res += 1

print(res)

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

def solve():
    ans = 1
    while X*(2**ans) <= Y:
        ans += 1
    print(ans)


solve()

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]
while a[-1] <= y :
    a.append(a[-1]*2)
print(len(a)-1)

Solution (Python):
x, y = map(int, input().split())
a = [x]
while True :
    new = a[-1]*2
    if new > y :
        break
    else :
        a.append(new)
print(len(a))

Solution (Python):
import math


X, Y = list(map(int, input().split()))


A = lambda i: X*2**(i-1)


n = int(math.log2(Y/X) + 1)

for i in range(-2, 3):
    if Y<A(n + i):
        print(n + i - 1)
        exit()

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

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

ans = 1
v = 2
for i in range(62):
    if X * v <= Y:
        ans += 1
    else:
        break

    v *= 2
print ans

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

result = 0
while x <= y :
    x *= 2
    result += 1

print result

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

tmp = x
gift = []
while (tmp <= y):
    gift.append(tmp)
    tmp *= 2

print (len(gift))

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

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

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

Solution (Python):
from math import log
a,b = input().split()
a = eval(a)
b = eval(b)
cnt = 0
while a <= b:
	cnt += 1
	a *= 2
print(cnt)

Solution (Python):
import re

c=input()
clist=re.findall("\d+",c)
a=int(clist[0])
b=int(clist[1])
for i in range(1,b+1):
    if a*(2**i)<=b:
        continue
    else:
        print(i)
        break