XOR Times 2 Is Sum

You are given an array $A$, consisting of $N$ **distinct** integers. Calculate number of pairs $(i,j)$ $(1 \le i < j \le N)$, such that $2 \cdot (A_i \oplus A_j) = A_i + A_j$, where $\oplus$ denotes [bitwise XOR](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). ### Input - The first line contains two integers $N$ $-$ the size of the array. - The second line contains $N$ space-separated in