CF BUDDY
← Problems·

926A · 2-3-numbers

1300 · implementation, math

Problem: A positive integer is called a 2-3-integer, if it is equal to 2x·3y for some non-negative integers x and y. In other words, these integers are such integers that only have 2 and 3 among their prime divisors. For example, integers 1, 6, 9, 16 and 108 — are 2-3 integers, while 5, 10, 21 and 120 are not.

Print the number of 2-3-integers on the given segment [l, r], i. e. the number of sich 2-3-integers t that l ≤ t ≤ r.

Input Format: The only line contains two integers l and r (1 ≤ l ≤ r ≤ 2·109).

Output Format: Print a single integer the number of 2-3-integers on the segment [l, r].

Note: In the first example the 2-3-integers are 1, 2, 3, 4, 6, 8 and 9.

In the second example the 2-3-integers are 108, 128, 144, 162 and 192.

Sample Cases

Case 1

Input

1 10

Output

7

Case 2

Input

100 200

Output

5

Case 3

Input

1 2000000000

Output

326

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback