CF611B.New Year and Old Property

The year 2015 is almost over.

Limak is a little polar bear. He has recently learnt about the binary system. He noticed that the passing year has exactly one zero in its representation in the binary system — 201510 = 111110111112. Note that he doesn't care about the number of zeros in the decimal representation.

Limak chose some interval of years. He is going to count all years from this interval that have exactly one zero in the binary representation. Can you do it faster?

Assume that all positive integers are always written without leading zeros.

2015 年即将结束。

Limak 是一只小北极熊。他最近学习了二进制系统。他注意到，刚刚过去的一年（2015）在二进制表示中恰好包含一个零：$2015_{10} = 11111011111_2$。注意，他对十进制表示中的零的个数并不关心。

Limak 选择了一个年份区间。他打算统计该区间内所有在二进制表示中恰好包含一个零的年份。你能比他更快地完成这项统计吗？

假设所有正整数均以无前导零的形式书写。

The only line of the input contains two integers a and b (1 ≤ a ≤ b ≤ 1018) — the first year and the last year in Limak's interval respectively.

输入仅包含一行，其中有两个整数 $a$ 和 $b$（$1 ≤ a ≤ b ≤ 10^{18}$），分别表示 Limak 所考虑年份区间的起始年份和结束年份。

Print one integer – the number of years Limak will count in his chosen interval.

输出一个整数——Limak 在他选择的区间内将要计数的年份数。

In the first sample Limak's interval contains numbers 510 = 1012, 610 = 1102, 710 = 1112, 810 = 10002, 910 = 10012 and 1010 = 10102. Two of them (1012 and 1102) have the described property.

在第一个样例中，Limak 的区间包含数字 $5_{10} = 101_2$、$6_{10} = 110_2$、$7_{10} = 111_2$、$8_{10} = 1000_2$、$9_{10} = 1001_2$ 和 $10_{10} = 1010_2$。其中有两个数（$101_2$ 和 $110_2$）具有所描述的性质。