Given L and R ( 1<= L , R <= 10^{18} ) count all numbers in this range which have prime Number of Set Bits in Binary Representation.

**Input:** L = 10, R = 15

**Output:** 5

**Explanation:**

10 -> 1010 (2 set bits, 2 is prime)

11 -> 1011 (3 set bits, 3 is prime)

12 -> 1100 (2 set bits, 2 is prime)

13 -> 1101 (3 set bits, 3 is prime)

14 -> 1110 (3 set bits, 3 is prime)

15 -> 1111 (4 set bits, 4 is not prime)

Link 1 Link2 (in this 1<= L , R <= 10^{6} )

Can we do better than O(n) ? or not possible with this constraints ?

Help @galencolin @everule1