Xor Equality

For a given $N$, find the number of ways to choose an integer $x$ from the range $[0, 2^N - 1]$ such that $x \oplus (x+1) = (x+2) \oplus (x+3)$, where $\oplus$ denotes the bitwise XOR operator. Since the number of valid $x$ can be large, output it modulo $10^9+7$. ### Input - The first line contains an integer $T$, the number of test cases. Then the test cases follow. - The only line of each t