Priya and AND

Priya loves bitwise AND, but she hates programming. Help her solve this problem. Given an array $A$ of size $N$, let $B_{ij}$ denote the [bitwise AND](https://en.wikipedia.org/wiki/Bitwise_operation#AND) of $A[i]$ and $A[j]$. You have to find the number of pairs $(i, j)$, such that $i \lt j$ and $B_{ij} = A[i]$. ### Input - The first line of the input contains a single integer $T$ denoting the