Finding The XOR

Given a long integer $x$, count the number of values of $a$ satisfying the following conditions: - $a ⊕ x \gt x$ - $0 \lt a \lt x$ where $a$ and $x$ are long integers and $⊕$ is the bitwise XOR operator. You are given $q$ queries, and each query is in the form of a long integer denoting $x$. For each query, print the total number of values of $a$ satisfying the conditions above on a new lin