GCD and XOR 2 (Easy)

**This is the easy version of the problem. Here $N \le 60$. This is worth $100$ points in Division $1$ and unscoreable elsewhere.** You are given integers $N$ and $D$, please count the number of pairs $(X, Y)$ satisfying the following conditions: - $1 \le X < Y < 2^N$ - $Y - X = D$ - $\gcd(X, Y) = X \oplus Y$ $\\$ Here, $\oplus$ denotes the [Bitwise XOR operator](https://en.wikipedia.org/wiki/B