XOR & Sum

Given two numbers $l$ and $r$, count the number of non-negative integers $x$ such that there exists a pair of integers $(a, b)$ that satisfy the following requirements: - $ x = a \oplus b = a + b $ - $l \leq a \leq b \leq r$. Here $ \oplus $ refers to the bitwise operation of XOR. Note: You should output the number of $x$. Not the number of pairs $(a, b)$. ### Input - The first line of input wi