Xorry 2

[This problem is very similar to XORRY1. The only difference is that instead of printing any one Xorry pair, you are now asked to count the number of Xorry pairs] You are given an integer $X$. Two integers ($A$, $B$) are said to be an Xorry pair, if the following conditions are satisfied: - $A \oplus B = X$ - $0 \leq A \leq B \leq X$ - Among all the pairs which satisfy the above two conditions,