Олимпиадная задача

A = int(input())
B = int(input())
c = [i for i in range(A, B+1)]
main_mas = []
out_mas = []
 
 
for i in c:
    main_mas.append(str(bin(i))[:1:-1])
print(main_mas)
for elem in range(len(main_mas)):
    d = main_mas[elem].index('1')
    f = main_mas[elem][:d].replace('1', '0')
    c = main_mas[elem][d+1:].replace('1', '0')
    print(main_mas)
    print('')
    out = f + main_mas[elem][d] + c
    main_mas[elem] = out[::-1]
 
 
for i in main_mas:
   out_mas.append(int(eval('0b'+'{}'.format(i))))
 
print(sum(out_mas))

a = 1
b = 10**1500

import math
 
A = int(input(" "))
B = int(input())
sums = []
 
i = 1
d = math.floor(math.log2(B))
 
for i in range(d+1):
    d = B//(2**i)
    if abs(d//2 - d/2) >= 0.5:
        sums.append(math.ceil((d/2))*(2**i))
    else:
        sums.append(math.floor(d/2)*(2**i))
 
print(sum(sums))

f = lambda n: 2*f(n//2) + n//2 + n%2 if n else 0
a, b = map(int, input().split())
print(f(b)-f(a)+1)

import math
a, b = map(int,input().split())
 
def binN(c) :
    n = int(math.log2(c)) + 1
    res, kof = 0, 0
    for k in range(n) :
        st = 2 ** (n - k -1)
        count = c // st - kof
        kof += count
        res += st * count
    return res
 
if a < 2 :
    print(binN(b))
else :
    print(binN(b) - binN(a-1))

f = lambda n: 2*f(n//2) + n//2 + n%2 if n else 0
a, b = map(int, input().split())
print(f(b)-f(a-1))